/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:46:07,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:46:07,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:46:07,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:46:07,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:46:07,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:46:07,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:46:07,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:46:07,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:46:07,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:46:07,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:46:07,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:46:07,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:46:07,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:46:07,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:46:07,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:46:07,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:46:07,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:46:07,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:46:07,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:46:07,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:46:07,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:46:07,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:46:07,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:46:07,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:46:07,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:46:07,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:46:07,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:46:07,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:46:07,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:46:07,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:46:07,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:46:07,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:46:07,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:46:07,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:46:07,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:46:07,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:46:07,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:46:07,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:46:07,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:46:07,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:46:07,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:46:07,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:46:07,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:46:07,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:46:07,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:46:07,894 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:46:07,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:46:07,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:46:07,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:46:07,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:46:07,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:46:07,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:46:07,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:46:07,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:46:07,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:46:07,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:46:07,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:46:07,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:46:07,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:46:07,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:46:07,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:46:07,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:46:07,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:46:07,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:46:07,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:46:07,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:46:07,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:46:07,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:46:07,901 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:46:07,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:46:07,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:46:07,902 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:46:07,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:46:08,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:46:08,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:46:08,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:46:08,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:46:08,203 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:46:08,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_tso.oepc.i [2019-12-27 21:46:08,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4b17d8f/52aeb23bece34c87a093b7491fc178f3/FLAG7d6c1362f [2019-12-27 21:46:08,885 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:46:08,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_tso.oepc.i [2019-12-27 21:46:08,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4b17d8f/52aeb23bece34c87a093b7491fc178f3/FLAG7d6c1362f [2019-12-27 21:46:09,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4b17d8f/52aeb23bece34c87a093b7491fc178f3 [2019-12-27 21:46:09,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:46:09,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:46:09,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:09,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:46:09,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:46:09,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:09,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09, skipping insertion in model container [2019-12-27 21:46:09,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:09,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:46:09,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:46:09,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:09,816 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:46:09,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:09,977 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:46:09,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09 WrapperNode [2019-12-27 21:46:09,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:09,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:09,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:46:09,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:46:09,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:10,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:46:10,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:46:10,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:46:10,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... [2019-12-27 21:46:10,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:46:10,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:46:10,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:46:10,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:46:10,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:46:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:46:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:46:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:46:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:46:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:46:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:46:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:46:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:46:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:46:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:46:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:46:10,150 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:46:10,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:46:10,863 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:46:10,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:10 BoogieIcfgContainer [2019-12-27 21:46:10,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:46:10,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:46:10,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:46:10,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:46:10,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:46:09" (1/3) ... [2019-12-27 21:46:10,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed03fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:10, skipping insertion in model container [2019-12-27 21:46:10,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:09" (2/3) ... [2019-12-27 21:46:10,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed03fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:10, skipping insertion in model container [2019-12-27 21:46:10,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:10" (3/3) ... [2019-12-27 21:46:10,873 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_tso.oepc.i [2019-12-27 21:46:10,884 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:46:10,885 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:46:10,895 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:46:10,897 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:46:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:11,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:46:11,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:46:11,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:46:11,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:46:11,042 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:46:11,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:46:11,042 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:46:11,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:46:11,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:46:11,060 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:46:11,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:46:11,160 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:46:11,160 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:11,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:46:11,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:46:11,239 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:46:11,239 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:11,245 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:46:11,260 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:46:11,261 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:46:14,631 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:46:14,736 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:46:14,765 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 21:46:14,765 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 21:46:14,769 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 21:46:15,200 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 21:46:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 21:46:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:46:15,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:15,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:46:15,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 21:46:15,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:15,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511245896] [2019-12-27 21:46:15,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:15,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511245896] [2019-12-27 21:46:15,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:15,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:46:15,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6282956] [2019-12-27 21:46:15,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:15,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:15,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:46:15,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:15,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:15,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:46:15,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:46:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:15,517 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 21:46:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:15,816 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 21:46:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:46:15,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:46:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:15,901 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 21:46:15,902 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 21:46:15,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 21:46:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 21:46:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 21:46:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 21:46:16,388 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 21:46:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:16,388 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 21:46:16,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:46:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 21:46:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:46:16,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:16,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:16,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 21:46:16,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:16,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40933768] [2019-12-27 21:46:16,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:16,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40933768] [2019-12-27 21:46:16,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:16,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:46:16,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672747083] [2019-12-27 21:46:16,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:16,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:16,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:46:16,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:16,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:46:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:46:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:46:16,542 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 21:46:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:16,972 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 21:46:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:46:16,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:46:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:17,078 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 21:46:17,078 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 21:46:17,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:46:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 21:46:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 21:46:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 21:46:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 21:46:17,562 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 21:46:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:17,563 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 21:46:17,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:46:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 21:46:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:46:17,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:17,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:17,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 21:46:17,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:17,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8936174] [2019-12-27 21:46:17,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:17,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8936174] [2019-12-27 21:46:17,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:17,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:46:17,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315811920] [2019-12-27 21:46:17,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:17,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:17,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:46:17,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:17,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:17,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:46:17,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:46:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:46:17,710 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 21:46:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:18,276 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 21:46:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:46:18,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:46:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:18,328 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 21:46:18,328 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 21:46:18,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:46:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 21:46:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 21:46:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 21:46:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 21:46:18,752 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 21:46:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:18,753 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 21:46:18,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:46:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 21:46:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:46:18,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:18,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:18,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 21:46:18,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:18,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357725167] [2019-12-27 21:46:18,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:18,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357725167] [2019-12-27 21:46:18,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:18,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:46:18,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569810590] [2019-12-27 21:46:18,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:18,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:18,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:46:18,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:18,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:46:18,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:46:18,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:46:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:46:18,873 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 4 states. [2019-12-27 21:46:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:19,012 INFO L93 Difference]: Finished difference Result 2163 states and 5380 transitions. [2019-12-27 21:46:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:46:19,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:46:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:19,016 INFO L225 Difference]: With dead ends: 2163 [2019-12-27 21:46:19,016 INFO L226 Difference]: Without dead ends: 1539 [2019-12-27 21:46:19,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:46:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-27 21:46:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-12-27 21:46:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-27 21:46:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-27 21:46:19,052 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 16 [2019-12-27 21:46:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-27 21:46:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:46:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-27 21:46:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:46:19,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:19,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:19,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 21:46:19,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:19,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110380280] [2019-12-27 21:46:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:19,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110380280] [2019-12-27 21:46:19,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:19,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:46:19,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951486161] [2019-12-27 21:46:19,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:19,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:19,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:46:19,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:19,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:19,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:46:19,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:46:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:46:19,202 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-27 21:46:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:19,632 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-27 21:46:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:46:19,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:46:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:19,640 INFO L225 Difference]: With dead ends: 2313 [2019-12-27 21:46:19,640 INFO L226 Difference]: Without dead ends: 2260 [2019-12-27 21:46:19,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:46:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-27 21:46:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-27 21:46:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-27 21:46:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-27 21:46:19,678 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-27 21:46:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:19,678 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-27 21:46:19,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:46:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-27 21:46:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:46:19,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:19,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:19,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-27 21:46:19,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:19,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105921950] [2019-12-27 21:46:19,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:19,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105921950] [2019-12-27 21:46:19,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:19,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:46:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523616755] [2019-12-27 21:46:19,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:19,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:19,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:46:19,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:19,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:46:19,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:46:19,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:46:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:46:19,883 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 8 states. [2019-12-27 21:46:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:20,594 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-27 21:46:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:46:20,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 21:46:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:20,601 INFO L225 Difference]: With dead ends: 2343 [2019-12-27 21:46:20,601 INFO L226 Difference]: Without dead ends: 2343 [2019-12-27 21:46:20,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:46:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-27 21:46:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-27 21:46:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 21:46:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-27 21:46:20,644 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-27 21:46:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:20,645 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-27 21:46:20,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:46:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-27 21:46:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:46:20,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:20,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:20,648 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 21:46:20,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:20,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780231629] [2019-12-27 21:46:20,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:20,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780231629] [2019-12-27 21:46:20,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:20,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:46:20,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621469209] [2019-12-27 21:46:20,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:20,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:20,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 21:46:20,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:20,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:46:20,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:46:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:46:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:46:20,840 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 6 states. [2019-12-27 21:46:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:20,887 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-27 21:46:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:46:20,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:46:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:20,890 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 21:46:20,890 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 21:46:20,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:46:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 21:46:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-27 21:46:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-27 21:46:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-27 21:46:20,914 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-27 21:46:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:20,915 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-27 21:46:20,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:46:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-27 21:46:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:46:20,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:20,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:20,923 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-27 21:46:20,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:20,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018842562] [2019-12-27 21:46:20,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:21,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018842562] [2019-12-27 21:46:21,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:21,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:46:21,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746145988] [2019-12-27 21:46:21,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:21,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:21,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 21:46:21,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:21,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:46:21,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:46:21,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:46:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:46:21,094 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-27 21:46:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:21,438 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-27 21:46:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:46:21,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 21:46:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:21,444 INFO L225 Difference]: With dead ends: 3013 [2019-12-27 21:46:21,444 INFO L226 Difference]: Without dead ends: 2064 [2019-12-27 21:46:21,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:46:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-27 21:46:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-27 21:46:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-27 21:46:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-27 21:46:21,472 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-27 21:46:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:21,472 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-27 21:46:21,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:46:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-27 21:46:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:46:21,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:21,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:21,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-27 21:46:21,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161699513] [2019-12-27 21:46:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:21,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161699513] [2019-12-27 21:46:21,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:21,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:46:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [31212689] [2019-12-27 21:46:21,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:21,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:21,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:46:21,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:21,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:46:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:46:21,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:46:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:46:21,696 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-27 21:46:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:21,717 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-27 21:46:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:46:21,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 21:46:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:21,719 INFO L225 Difference]: With dead ends: 1851 [2019-12-27 21:46:21,719 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 21:46:21,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:46:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 21:46:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-27 21:46:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-27 21:46:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-27 21:46:21,735 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-27 21:46:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:21,735 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-27 21:46:21,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:46:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-27 21:46:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:46:21,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:21,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:21,738 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-27 21:46:21,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:21,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864945013] [2019-12-27 21:46:21,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:21,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864945013] [2019-12-27 21:46:21,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:21,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:46:21,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2096873965] [2019-12-27 21:46:21,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:21,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:21,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 111 transitions. [2019-12-27 21:46:21,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:21,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:46:21,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:46:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:46:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:46:21,987 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 9 states. [2019-12-27 21:46:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:22,262 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-27 21:46:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:46:22,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:46:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:22,264 INFO L225 Difference]: With dead ends: 1396 [2019-12-27 21:46:22,265 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 21:46:22,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:46:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 21:46:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-27 21:46:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 21:46:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-27 21:46:22,282 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-27 21:46:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:22,282 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-27 21:46:22,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:46:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-27 21:46:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:46:22,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:22,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:22,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-27 21:46:22,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:22,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749929824] [2019-12-27 21:46:22,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:22,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749929824] [2019-12-27 21:46:22,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:22,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:46:22,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755299310] [2019-12-27 21:46:22,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:22,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:22,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 21:46:22,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:22,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:22,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:46:22,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:46:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:22,453 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-27 21:46:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:22,507 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-27 21:46:22,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:46:22,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:46:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:22,509 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 21:46:22,510 INFO L226 Difference]: Without dead ends: 1036 [2019-12-27 21:46:22,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-27 21:46:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-27 21:46:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 21:46:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-27 21:46:22,526 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-27 21:46:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:22,527 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-27 21:46:22,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:46:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-27 21:46:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:46:22,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:22,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:22,530 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-27 21:46:22,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:22,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598327241] [2019-12-27 21:46:22,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:22,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598327241] [2019-12-27 21:46:22,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:22,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:46:22,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987577095] [2019-12-27 21:46:22,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:22,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:22,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 131 transitions. [2019-12-27 21:46:22,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:22,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:46:22,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:46:22,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:46:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:46:22,816 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 8 states. [2019-12-27 21:46:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:23,683 INFO L93 Difference]: Finished difference Result 1435 states and 2986 transitions. [2019-12-27 21:46:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:46:23,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:46:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:23,686 INFO L225 Difference]: With dead ends: 1435 [2019-12-27 21:46:23,686 INFO L226 Difference]: Without dead ends: 1435 [2019-12-27 21:46:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:46:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-12-27 21:46:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 999. [2019-12-27 21:46:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 21:46:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2128 transitions. [2019-12-27 21:46:23,706 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2128 transitions. Word has length 52 [2019-12-27 21:46:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:23,706 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2128 transitions. [2019-12-27 21:46:23,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:46:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2128 transitions. [2019-12-27 21:46:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:46:23,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:23,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:23,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-27 21:46:23,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:23,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157384225] [2019-12-27 21:46:23,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:46:23,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157384225] [2019-12-27 21:46:23,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:23,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:46:23,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623022934] [2019-12-27 21:46:23,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:23,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:23,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 114 transitions. [2019-12-27 21:46:23,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:23,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:23,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:46:23,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:46:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:23,856 INFO L87 Difference]: Start difference. First operand 999 states and 2128 transitions. Second operand 3 states. [2019-12-27 21:46:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:23,868 INFO L93 Difference]: Finished difference Result 998 states and 2126 transitions. [2019-12-27 21:46:23,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:46:23,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:46:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:23,870 INFO L225 Difference]: With dead ends: 998 [2019-12-27 21:46:23,870 INFO L226 Difference]: Without dead ends: 998 [2019-12-27 21:46:23,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-12-27 21:46:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 780. [2019-12-27 21:46:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 21:46:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1696 transitions. [2019-12-27 21:46:23,886 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1696 transitions. Word has length 52 [2019-12-27 21:46:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:23,887 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1696 transitions. [2019-12-27 21:46:23,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:46:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1696 transitions. [2019-12-27 21:46:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:46:23,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:23,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:46:23,889 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 21:46:23,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:23,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9980408] [2019-12-27 21:46:23,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:46:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:46:24,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:46:24,039 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:46:24,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_ULTIMATE.start_main_~#t1557~0.offset_19| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1557~0.base_24| 4) |v_#length_17|) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_24|)) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~y$w_buff0~0_25) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1557~0.base_24|) (= v_~main$tmp_guard1~0_15 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1557~0.base_24| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1557~0.base_24|) |v_ULTIMATE.start_main_~#t1557~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1557~0.offset=|v_ULTIMATE.start_main_~#t1557~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t1557~0.base=|v_ULTIMATE.start_main_~#t1557~0.base_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1557~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1558~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1558~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1557~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:46:24,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t1558~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1558~0.base_13|) |v_ULTIMATE.start_main_~#t1558~0.offset_11| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1558~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1558~0.base_13|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1558~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1558~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1558~0.base=|v_ULTIMATE.start_main_~#t1558~0.base_13|, ULTIMATE.start_main_~#t1558~0.offset=|v_ULTIMATE.start_main_~#t1558~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1558~0.base, ULTIMATE.start_main_~#t1558~0.offset] because there is no mapped edge [2019-12-27 21:46:24,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out-145218015 1) (= ~__unbuffered_p0_EAX~0_Out-145218015 ~x~0_In-145218015) (= ~y$r_buff0_thd1~0_In-145218015 ~y$r_buff1_thd1~0_Out-145218015) (= ~y$r_buff1_thd0~0_Out-145218015 ~y$r_buff0_thd0~0_In-145218015) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-145218015 0)) (= ~y$r_buff0_thd2~0_In-145218015 ~y$r_buff1_thd2~0_Out-145218015)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-145218015, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-145218015, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-145218015, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-145218015, ~x~0=~x~0_In-145218015} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-145218015, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-145218015, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-145218015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-145218015, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-145218015, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-145218015, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-145218015, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-145218015, ~x~0=~x~0_In-145218015} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:46:24,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-641270823 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-641270823 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-641270823 |P0Thread1of1ForFork0_#t~ite5_Out-641270823|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-641270823|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-641270823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-641270823} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-641270823|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-641270823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-641270823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:46:24,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2114061175 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2114061175 |P1Thread1of1ForFork1_#t~ite21_Out-2114061175|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2114061175| |P1Thread1of1ForFork1_#t~ite20_Out-2114061175|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-2114061175| ~y$w_buff0_used~0_In-2114061175) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2114061175 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2114061175 256)) (and (= (mod ~y$w_buff1_used~0_In-2114061175 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-2114061175 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-2114061175| |P1Thread1of1ForFork1_#t~ite21_Out-2114061175|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2114061175|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114061175, ~weak$$choice2~0=~weak$$choice2~0_In-2114061175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2114061175|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114061175, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2114061175|, ~weak$$choice2~0=~weak$$choice2~0_In-2114061175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:46:24,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out-1683681376| |P1Thread1of1ForFork1_#t~ite23_Out-1683681376|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1683681376 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In-1683681376 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1683681376 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-1683681376 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In-1683681376 256) 0))) (or (let ((.cse0 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1683681376| 0) (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) .cse3 (= |P1Thread1of1ForFork1_#t~ite23_Out-1683681376| |P1Thread1of1ForFork1_#t~ite22_Out-1683681376|) .cse4 (not .cse5))) (and (or (and .cse3 .cse4 (or (and .cse6 .cse1) .cse5 (and .cse2 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1683681376| ~y$w_buff1_used~0_In-1683681376)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1683681376| |P1Thread1of1ForFork1_#t~ite23_In-1683681376|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite24_Out-1683681376| ~y$w_buff1_used~0_In-1683681376))) (= |P1Thread1of1ForFork1_#t~ite22_In-1683681376| |P1Thread1of1ForFork1_#t~ite22_Out-1683681376|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683681376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683681376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1683681376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1683681376|, ~weak$$choice2~0=~weak$$choice2~0_In-1683681376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683681376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683681376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683681376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1683681376|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1683681376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1683681376|, ~weak$$choice2~0=~weak$$choice2~0_In-1683681376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683681376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:46:24,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:46:24,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In153657265 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In153657265 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In153657265 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In153657265 256) 0))) (or (and (= ~y$w_buff1_used~0_In153657265 |P0Thread1of1ForFork0_#t~ite6_Out153657265|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out153657265|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In153657265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153657265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In153657265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153657265} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out153657265|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In153657265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153657265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In153657265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153657265} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:46:24,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1731213886 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1731213886 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1731213886 ~y$r_buff0_thd1~0_Out-1731213886)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out-1731213886 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731213886, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1731213886} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731213886, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1731213886|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1731213886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:46:24,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-83915088 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-83915088 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-83915088 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite29_Out-83915088| |P1Thread1of1ForFork1_#t~ite30_Out-83915088|)) (.cse3 (= (mod ~y$w_buff0_used~0_In-83915088 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-83915088 256)))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-83915088| |P1Thread1of1ForFork1_#t~ite29_In-83915088|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-83915088| ~y$r_buff1_thd2~0_In-83915088)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-83915088| ~y$r_buff1_thd2~0_In-83915088) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5)) (= |P1Thread1of1ForFork1_#t~ite28_In-83915088| |P1Thread1of1ForFork1_#t~ite28_Out-83915088|)) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-83915088| |P1Thread1of1ForFork1_#t~ite28_Out-83915088|) .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out-83915088| 0) (or (not .cse1) .cse6) (or (not .cse4) .cse6) .cse5 (not .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83915088, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-83915088|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-83915088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-83915088, ~weak$$choice2~0=~weak$$choice2~0_In-83915088, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-83915088|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83915088} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83915088, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-83915088|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-83915088|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-83915088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-83915088, ~weak$$choice2~0=~weak$$choice2~0_In-83915088, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-83915088|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83915088} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:46:24,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-430679322 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-430679322 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-430679322 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-430679322 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-430679322| ~y$r_buff1_thd1~0_In-430679322)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-430679322| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-430679322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-430679322, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-430679322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-430679322} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-430679322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-430679322, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-430679322|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-430679322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-430679322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:46:24,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 21:46:24,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In124977612 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In124977612 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out124977612| ~y~0_In124977612) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In124977612 |P1Thread1of1ForFork1_#t~ite32_Out124977612|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In124977612, ~y$w_buff1~0=~y$w_buff1~0_In124977612, ~y~0=~y~0_In124977612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In124977612} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In124977612, ~y$w_buff1~0=~y$w_buff1~0_In124977612, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out124977612|, ~y~0=~y~0_In124977612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In124977612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:46:24,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 21:46:24,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-914333802 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-914333802 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-914333802| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-914333802| ~y$w_buff0_used~0_In-914333802) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-914333802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-914333802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-914333802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-914333802, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-914333802|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:46:24,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1383702864 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1383702864 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1383702864 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1383702864 256)))) (or (and (= ~y$w_buff1_used~0_In1383702864 |P1Thread1of1ForFork1_#t~ite35_Out1383702864|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out1383702864| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1383702864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1383702864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383702864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1383702864} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1383702864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1383702864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383702864, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1383702864|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1383702864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:46:24,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-824636522 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-824636522 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-824636522 |P1Thread1of1ForFork1_#t~ite36_Out-824636522|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-824636522|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-824636522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-824636522, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-824636522|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:46:24,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1778088665 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1778088665 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1778088665 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1778088665 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1778088665| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1778088665 |P1Thread1of1ForFork1_#t~ite37_Out-1778088665|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1778088665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1778088665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1778088665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1778088665} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1778088665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1778088665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1778088665, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1778088665|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1778088665} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:46:24,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:46:24,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:46:24,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:46:24,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In81339999 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In81339999 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In81339999 |ULTIMATE.start_main_#t~ite40_Out81339999|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In81339999 |ULTIMATE.start_main_#t~ite40_Out81339999|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In81339999, ~y~0=~y~0_In81339999, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In81339999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out81339999|, ~y$w_buff1~0=~y$w_buff1~0_In81339999, ~y~0=~y~0_In81339999, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In81339999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:46:24,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 21:46:24,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-208242470 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-208242470 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-208242470|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-208242470 |ULTIMATE.start_main_#t~ite42_Out-208242470|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-208242470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208242470} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-208242470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-208242470, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-208242470|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:46:24,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1486968704 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1486968704 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1486968704 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1486968704 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1486968704|)) (and (= ~y$w_buff1_used~0_In-1486968704 |ULTIMATE.start_main_#t~ite43_Out-1486968704|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1486968704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1486968704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486968704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1486968704, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1486968704|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1486968704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486968704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:46:24,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1220419876 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1220419876 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1220419876 |ULTIMATE.start_main_#t~ite44_Out1220419876|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1220419876|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1220419876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220419876} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1220419876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220419876, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1220419876|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:46:24,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1185898267 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1185898267 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1185898267 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1185898267 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1185898267 |ULTIMATE.start_main_#t~ite45_Out1185898267|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1185898267|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1185898267, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1185898267, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1185898267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1185898267} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1185898267, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1185898267, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1185898267, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1185898267|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1185898267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:46:24,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:46:24,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:46:24 BasicIcfg [2019-12-27 21:46:24,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:46:24,177 INFO L168 Benchmark]: Toolchain (without parser) took 14967.44 ms. Allocated memory was 144.2 MB in the beginning and 574.1 MB in the end (delta: 429.9 MB). Free memory was 99.1 MB in the beginning and 462.0 MB in the end (delta: -362.9 MB). Peak memory consumption was 389.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,177 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.79 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 154.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 200.8 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,181 INFO L168 Benchmark]: Boogie Preprocessor took 39.25 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,181 INFO L168 Benchmark]: RCFGBuilder took 777.08 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,182 INFO L168 Benchmark]: TraceAbstraction took 13308.26 ms. Allocated memory was 200.8 MB in the beginning and 574.1 MB in the end (delta: 373.3 MB). Free memory was 105.2 MB in the beginning and 462.0 MB in the end (delta: -356.8 MB). Peak memory consumption was 339.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:24,194 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.79 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 154.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 200.8 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.25 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.08 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13308.26 ms. Allocated memory was 200.8 MB in the beginning and 574.1 MB in the end (delta: 373.3 MB). Free memory was 105.2 MB in the beginning and 462.0 MB in the end (delta: -356.8 MB). Peak memory consumption was 339.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1708 SDtfs, 1980 SDslu, 4084 SDs, 0 SdLazy, 2362 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 7348 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 50459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...