/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/mix048_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:25:28,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:25:28,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:25:28,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:25:28,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:25:28,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:25:28,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:25:28,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:25:28,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:25:28,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:25:28,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:25:28,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:25:28,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:25:28,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:25:28,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:25:28,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:25:28,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:25:28,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:25:28,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:25:28,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:25:28,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:25:28,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:25:28,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:25:28,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:25:28,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:25:28,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:25:28,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:25:28,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:25:28,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:25:28,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:25:28,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:25:28,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:25:28,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:25:28,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:25:28,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:25:28,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:25:28,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:25:28,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:25:28,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:25:28,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:25:28,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:25:28,569 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:25:28,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:25:28,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:25:28,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:25:28,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:25:28,604 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:25:28,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:25:28,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:25:28,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:25:28,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:25:28,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:25:28,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:25:28,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:25:28,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:25:28,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:25:28,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:25:28,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:25:28,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:25:28,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:25:28,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:25:28,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:25:28,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:25:28,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:25:28,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:25:28,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:25:28,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:25:28,615 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:25:28,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:25:28,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:25:28,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:25:28,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:25:28,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:25:28,911 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:25:28,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-27 21:25:28,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85e55b02/38df1b3871c14961ad5eee0f2e2b3900/FLAG13859f103 [2019-12-27 21:25:29,526 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:25:29,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-27 21:25:29,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85e55b02/38df1b3871c14961ad5eee0f2e2b3900/FLAG13859f103 [2019-12-27 21:25:29,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85e55b02/38df1b3871c14961ad5eee0f2e2b3900 [2019-12-27 21:25:29,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:25:29,824 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:25:29,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:25:29,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:25:29,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:25:29,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:25:29" (1/1) ... [2019-12-27 21:25:29,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:29, skipping insertion in model container [2019-12-27 21:25:29,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:25:29" (1/1) ... [2019-12-27 21:25:29,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:25:29,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:25:30,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:25:30,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:25:30,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:25:30,571 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:25:30,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30 WrapperNode [2019-12-27 21:25:30,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:25:30,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:25:30,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:25:30,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:25:30,582 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:25:30" (1/1) ... [2019-12-27 21:25:30,602 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:25:30" (1/1) ... [2019-12-27 21:25:30,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:25:30,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:25:30,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:25:30,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:25:30,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (1/1) ... [2019-12-27 21:25:30,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:25:30,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:25:30,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:25:30,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:25:30,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (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:25:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:25:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:25:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:25:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:25:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:25:30,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:25:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:25:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:25:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:25:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:25:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:25:30,752 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:25:31,503 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:25:31,504 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:25:31,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:25:31 BoogieIcfgContainer [2019-12-27 21:25:31,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:25:31,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:25:31,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:25:31,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:25:31,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:25:29" (1/3) ... [2019-12-27 21:25:31,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e657ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:25:31, skipping insertion in model container [2019-12-27 21:25:31,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:30" (2/3) ... [2019-12-27 21:25:31,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e657ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:25:31, skipping insertion in model container [2019-12-27 21:25:31,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:25:31" (3/3) ... [2019-12-27 21:25:31,518 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt.i [2019-12-27 21:25:31,528 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:25:31,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:25:31,535 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:25:31,536 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:25:31,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:31,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:25:31,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:25:31,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:25:31,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:25:31,682 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:25:31,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:25:31,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:25:31,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:25:31,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:25:31,698 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:25:31,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:25:31,787 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:25:31,788 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:25:31,803 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:25:31,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:25:31,864 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:25:31,864 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:25:31,870 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:25:31,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:25:31,886 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:25:35,233 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:25:35,341 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:25:35,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 21:25:35,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 21:25:35,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 21:25:35,822 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 21:25:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 21:25:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:25:35,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:35,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:25:35,833 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:25:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 21:25:35,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:35,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145096982] [2019-12-27 21:25:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:36,056 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:25:36,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145096982] [2019-12-27 21:25:36,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:36,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:25:36,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564132007] [2019-12-27 21:25:36,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:36,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:36,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:25:36,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:36,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:36,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:36,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:36,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:36,102 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 21:25:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:36,351 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 21:25:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:36,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:25:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:36,430 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 21:25:36,430 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 21:25:36,432 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:25:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 21:25:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 21:25:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 21:25:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 21:25:36,912 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 21:25:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:36,914 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 21:25:36,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 21:25:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:25:36,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:36,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:36,920 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:25:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 21:25:36,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:36,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809621620] [2019-12-27 21:25:36,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:37,119 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:25:37,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809621620] [2019-12-27 21:25:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:37,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073088025] [2019-12-27 21:25:37,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:37,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:37,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:25:37,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:37,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:37,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:25:37,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:25:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:25:37,132 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 21:25:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:37,579 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 21:25:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:25:37,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:25:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:37,659 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 21:25:37,659 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 21:25:37,660 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:25:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 21:25:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 21:25:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 21:25:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 21:25:38,166 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 21:25:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:38,167 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 21:25:38,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:25:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 21:25:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:25:38,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:38,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:38,173 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:25:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 21:25:38,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:38,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618954323] [2019-12-27 21:25:38,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:38,240 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:25:38,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618954323] [2019-12-27 21:25:38,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:38,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:38,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1318086484] [2019-12-27 21:25:38,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:38,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:38,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:25:38,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:38,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:38,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:38,247 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 21:25:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:38,614 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 21:25:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:25:38,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:25:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:38,662 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 21:25:38,662 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 21:25:38,663 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:25:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 21:25:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 21:25:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 21:25:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 21:25:39,650 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 21:25:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:39,654 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 21:25:39,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 21:25:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:25:39,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:39,658 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:25:39,659 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:25:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:39,659 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 21:25:39,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:39,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713944493] [2019-12-27 21:25:39,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:39,761 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:25:39,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713944493] [2019-12-27 21:25:39,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:39,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:39,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629337720] [2019-12-27 21:25:39,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:39,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:39,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:25:39,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:39,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:39,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:39,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:39,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:39,773 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-27 21:25:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:39,842 INFO L93 Difference]: Finished difference Result 10482 states and 32382 transitions. [2019-12-27 21:25:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:39,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:25:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:39,877 INFO L225 Difference]: With dead ends: 10482 [2019-12-27 21:25:39,878 INFO L226 Difference]: Without dead ends: 10482 [2019-12-27 21:25:39,878 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:25:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10482 states. [2019-12-27 21:25:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10482 to 10402. [2019-12-27 21:25:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10402 states. [2019-12-27 21:25:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 32150 transitions. [2019-12-27 21:25:40,309 INFO L78 Accepts]: Start accepts. Automaton has 10402 states and 32150 transitions. Word has length 16 [2019-12-27 21:25:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:40,310 INFO L462 AbstractCegarLoop]: Abstraction has 10402 states and 32150 transitions. [2019-12-27 21:25:40,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10402 states and 32150 transitions. [2019-12-27 21:25:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:25:40,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:40,314 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:25:40,314 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:25:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1689443989, now seen corresponding path program 1 times [2019-12-27 21:25:40,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:40,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227586943] [2019-12-27 21:25:40,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:40,406 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:25:40,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227586943] [2019-12-27 21:25:40,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:40,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:40,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87677908] [2019-12-27 21:25:40,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:40,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:40,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:25:40,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:40,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:40,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:25:40,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:25:40,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:25:40,412 INFO L87 Difference]: Start difference. First operand 10402 states and 32150 transitions. Second operand 4 states. [2019-12-27 21:25:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:40,444 INFO L93 Difference]: Finished difference Result 2018 states and 4994 transitions. [2019-12-27 21:25:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:25:40,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:25:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:40,450 INFO L225 Difference]: With dead ends: 2018 [2019-12-27 21:25:40,451 INFO L226 Difference]: Without dead ends: 1434 [2019-12-27 21:25:40,451 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:25:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-12-27 21:25:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2019-12-27 21:25:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-12-27 21:25:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 3141 transitions. [2019-12-27 21:25:40,477 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 3141 transitions. Word has length 16 [2019-12-27 21:25:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:40,477 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 3141 transitions. [2019-12-27 21:25:40,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:25:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 3141 transitions. [2019-12-27 21:25:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:25:40,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:40,479 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:25:40,479 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:25:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:40,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 21:25:40,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:40,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383334685] [2019-12-27 21:25:40,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:40,559 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:25:40,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383334685] [2019-12-27 21:25:40,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:40,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937077363] [2019-12-27 21:25:40,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:40,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:40,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:25:40,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:40,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:40,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:40,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:40,572 INFO L87 Difference]: Start difference. First operand 1434 states and 3141 transitions. Second operand 6 states. [2019-12-27 21:25:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:40,936 INFO L93 Difference]: Finished difference Result 2226 states and 4691 transitions. [2019-12-27 21:25:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:25:40,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:25:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:40,941 INFO L225 Difference]: With dead ends: 2226 [2019-12-27 21:25:40,941 INFO L226 Difference]: Without dead ends: 2173 [2019-12-27 21:25:40,942 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:25:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-27 21:25:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1404. [2019-12-27 21:25:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-27 21:25:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 3075 transitions. [2019-12-27 21:25:40,971 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 3075 transitions. Word has length 25 [2019-12-27 21:25:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:40,971 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 3075 transitions. [2019-12-27 21:25:40,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 3075 transitions. [2019-12-27 21:25:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:25:40,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:40,974 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:25:40,974 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:25:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 21:25:40,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:40,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351612385] [2019-12-27 21:25:40,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:41,056 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:25:41,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351612385] [2019-12-27 21:25:41,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:41,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:41,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357713518] [2019-12-27 21:25:41,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:41,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:41,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 21:25:41,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:41,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:25:41,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:41,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:41,116 INFO L87 Difference]: Start difference. First operand 1404 states and 3075 transitions. Second operand 6 states. [2019-12-27 21:25:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:41,159 INFO L93 Difference]: Finished difference Result 739 states and 1600 transitions. [2019-12-27 21:25:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:25:41,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:25:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:41,162 INFO L225 Difference]: With dead ends: 739 [2019-12-27 21:25:41,162 INFO L226 Difference]: Without dead ends: 677 [2019-12-27 21:25:41,162 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:25:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-27 21:25:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2019-12-27 21:25:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-27 21:25:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1465 transitions. [2019-12-27 21:25:41,173 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1465 transitions. Word has length 27 [2019-12-27 21:25:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:41,174 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1465 transitions. [2019-12-27 21:25:41,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1465 transitions. [2019-12-27 21:25:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:41,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:41,176 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:25:41,177 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:25:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1271151221, now seen corresponding path program 1 times [2019-12-27 21:25:41,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:41,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913207803] [2019-12-27 21:25:41,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:41,301 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:25:41,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913207803] [2019-12-27 21:25:41,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:41,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882165901] [2019-12-27 21:25:41,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:41,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:41,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 106 transitions. [2019-12-27 21:25:41,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:41,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:25:41,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:25:41,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:25:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:25:41,489 INFO L87 Difference]: Start difference. First operand 677 states and 1465 transitions. Second operand 7 states. [2019-12-27 21:25:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:41,768 INFO L93 Difference]: Finished difference Result 2064 states and 4333 transitions. [2019-12-27 21:25:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:25:41,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:25:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:41,774 INFO L225 Difference]: With dead ends: 2064 [2019-12-27 21:25:41,775 INFO L226 Difference]: Without dead ends: 1442 [2019-12-27 21:25:41,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 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:25:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-12-27 21:25:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 741. [2019-12-27 21:25:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-27 21:25:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1602 transitions. [2019-12-27 21:25:41,793 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1602 transitions. Word has length 52 [2019-12-27 21:25:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1602 transitions. [2019-12-27 21:25:41,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:25:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1602 transitions. [2019-12-27 21:25:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:41,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:41,796 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:25:41,796 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:25:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash -196823289, now seen corresponding path program 2 times [2019-12-27 21:25:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:41,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202899085] [2019-12-27 21:25:41,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:41,872 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:25:41,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202899085] [2019-12-27 21:25:41,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:41,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:41,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541749955] [2019-12-27 21:25:41,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:41,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:41,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 108 transitions. [2019-12-27 21:25:41,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:41,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:25:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:25:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:25:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:25:41,958 INFO L87 Difference]: Start difference. First operand 741 states and 1602 transitions. Second operand 4 states. [2019-12-27 21:25:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:41,981 INFO L93 Difference]: Finished difference Result 1196 states and 2609 transitions. [2019-12-27 21:25:41,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:25:41,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 21:25:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:41,983 INFO L225 Difference]: With dead ends: 1196 [2019-12-27 21:25:41,983 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 21:25:41,983 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:25:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 21:25:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-27 21:25:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 21:25:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1092 transitions. [2019-12-27 21:25:41,991 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1092 transitions. Word has length 52 [2019-12-27 21:25:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:41,991 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1092 transitions. [2019-12-27 21:25:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:25:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1092 transitions. [2019-12-27 21:25:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:41,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:41,993 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:25:41,994 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:25:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 3 times [2019-12-27 21:25:41,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:41,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095107908] [2019-12-27 21:25:41,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:42,114 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:25:42,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095107908] [2019-12-27 21:25:42,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:42,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387256112] [2019-12-27 21:25:42,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:42,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:42,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 125 transitions. [2019-12-27 21:25:42,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:42,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:25:42,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:25:42,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:42,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:25:42,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:25:42,360 INFO L87 Difference]: Start difference. First operand 500 states and 1092 transitions. Second operand 9 states. [2019-12-27 21:25:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:42,612 INFO L93 Difference]: Finished difference Result 992 states and 2078 transitions. [2019-12-27 21:25:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:25:42,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 21:25:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:42,614 INFO L225 Difference]: With dead ends: 992 [2019-12-27 21:25:42,614 INFO L226 Difference]: Without dead ends: 701 [2019-12-27 21:25:42,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:25:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-27 21:25:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 532. [2019-12-27 21:25:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-27 21:25:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1152 transitions. [2019-12-27 21:25:42,625 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1152 transitions. Word has length 52 [2019-12-27 21:25:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:42,625 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1152 transitions. [2019-12-27 21:25:42,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:25:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1152 transitions. [2019-12-27 21:25:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:42,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:42,627 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:25:42,627 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:25:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 4 times [2019-12-27 21:25:42,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:42,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033959604] [2019-12-27 21:25:42,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:42,733 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:25:42,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033959604] [2019-12-27 21:25:42,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:42,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:25:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359655793] [2019-12-27 21:25:42,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:42,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:42,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 127 transitions. [2019-12-27 21:25:42,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:42,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:25:42,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:25:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:25:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:25:42,911 INFO L87 Difference]: Start difference. First operand 532 states and 1152 transitions. Second operand 7 states. [2019-12-27 21:25:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:43,893 INFO L93 Difference]: Finished difference Result 1228 states and 2591 transitions. [2019-12-27 21:25:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:25:43,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:25:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:43,896 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:25:43,896 INFO L226 Difference]: Without dead ends: 1204 [2019-12-27 21:25:43,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:25:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-27 21:25:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 797. [2019-12-27 21:25:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 21:25:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1733 transitions. [2019-12-27 21:25:43,912 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1733 transitions. Word has length 52 [2019-12-27 21:25:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:43,913 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1733 transitions. [2019-12-27 21:25:43,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:25:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1733 transitions. [2019-12-27 21:25:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:43,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:43,916 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:25:43,916 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:25:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 5 times [2019-12-27 21:25:43,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:43,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174441599] [2019-12-27 21:25:43,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:43,976 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:25:43,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174441599] [2019-12-27 21:25:43,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:43,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:43,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450189120] [2019-12-27 21:25:43,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:43,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:44,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 102 transitions. [2019-12-27 21:25:44,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:44,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:44,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:44,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:44,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:44,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:44,048 INFO L87 Difference]: Start difference. First operand 797 states and 1733 transitions. Second operand 3 states. [2019-12-27 21:25:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:44,095 INFO L93 Difference]: Finished difference Result 991 states and 2134 transitions. [2019-12-27 21:25:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:44,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:25:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:44,097 INFO L225 Difference]: With dead ends: 991 [2019-12-27 21:25:44,097 INFO L226 Difference]: Without dead ends: 991 [2019-12-27 21:25:44,098 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:25:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-27 21:25:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 780. [2019-12-27 21:25:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 21:25:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1696 transitions. [2019-12-27 21:25:44,112 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1696 transitions. Word has length 52 [2019-12-27 21:25:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:44,112 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1696 transitions. [2019-12-27 21:25:44,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1696 transitions. [2019-12-27 21:25:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:25:44,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:44,114 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:25:44,115 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:25:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 21:25:44,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:44,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575514196] [2019-12-27 21:25:44,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:44,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:25:44,227 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:25:44,230 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_ULTIMATE.start_main_~#t1287~0.offset_19|) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_24| 1) |v_#valid_49|) (= 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) (= 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) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1287~0.base_24| 4) |v_#length_17|) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_24|) |v_ULTIMATE.start_main_~#t1287~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$w_buff0_used~0_106 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1287~0.base_24|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_24|) 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 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{~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_~#t1287~0.offset=|v_ULTIMATE.start_main_~#t1287~0.offset_19|, 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_~#t1287~0.base=|v_ULTIMATE.start_main_~#t1287~0.base_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #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_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_25|, 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|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_19|, ~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[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1287~0.offset, 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_~#t1287~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1288~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, ULTIMATE.start_main_~#t1288~0.offset, ~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:25:44,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1288~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1288~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13|) |v_ULTIMATE.start_main_~#t1288~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_13|, #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_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1288~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1288~0.offset] because there is no mapped edge [2019-12-27 21:25:44,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~x~0_In-1505682697 ~__unbuffered_p0_EAX~0_Out-1505682697) (= 1 ~y$r_buff0_thd1~0_Out-1505682697) (= ~y$r_buff1_thd2~0_Out-1505682697 ~y$r_buff0_thd2~0_In-1505682697) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1505682697 0)) (= ~y$r_buff0_thd1~0_In-1505682697 ~y$r_buff1_thd1~0_Out-1505682697) (= ~y$r_buff1_thd0~0_Out-1505682697 ~y$r_buff0_thd0~0_In-1505682697)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1505682697, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1505682697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505682697, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1505682697, ~x~0=~x~0_In-1505682697} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1505682697, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1505682697, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1505682697, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1505682697, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1505682697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505682697, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1505682697, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1505682697, ~x~0=~x~0_In-1505682697} 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:25:44,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-30139028 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-30139028 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-30139028| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-30139028| ~y$w_buff0_used~0_In-30139028) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30139028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-30139028} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-30139028|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-30139028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-30139028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:25:44,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1800880237 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1800880237 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1800880237 256))) (= 0 (mod ~y$w_buff0_used~0_In-1800880237 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1800880237 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1800880237| |P1Thread1of1ForFork1_#t~ite21_Out-1800880237|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1800880237| ~y$w_buff0_used~0_In-1800880237)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1800880237| |P1Thread1of1ForFork1_#t~ite20_Out-1800880237|) (= ~y$w_buff0_used~0_In-1800880237 |P1Thread1of1ForFork1_#t~ite21_Out-1800880237|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1800880237, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1800880237, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1800880237|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1800880237, ~weak$$choice2~0=~weak$$choice2~0_In-1800880237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1800880237} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1800880237, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1800880237, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1800880237|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1800880237, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1800880237|, ~weak$$choice2~0=~weak$$choice2~0_In-1800880237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1800880237} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:25:44,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In263115976 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In263115976 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In263115976 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In263115976 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out263115976| |P1Thread1of1ForFork1_#t~ite23_Out263115976|)) (.cse5 (= (mod ~weak$$choice2~0_In263115976 256) 0))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) (= |P1Thread1of1ForFork1_#t~ite22_Out263115976| |P1Thread1of1ForFork1_#t~ite23_Out263115976|) (or .cse0 (not .cse2)) (not .cse3) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out263115976| 0))) (and (= |P1Thread1of1ForFork1_#t~ite22_In263115976| |P1Thread1of1ForFork1_#t~ite22_Out263115976|) (or (and (= ~y$w_buff1_used~0_In263115976 |P1Thread1of1ForFork1_#t~ite23_Out263115976|) (or .cse3 (and .cse6 .cse2) (and .cse1 .cse6)) .cse5 .cse4) (and (= ~y$w_buff1_used~0_In263115976 |P1Thread1of1ForFork1_#t~ite24_Out263115976|) (= |P1Thread1of1ForFork1_#t~ite23_In263115976| |P1Thread1of1ForFork1_#t~ite23_Out263115976|) (not .cse5)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In263115976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In263115976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In263115976, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In263115976|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In263115976|, ~weak$$choice2~0=~weak$$choice2~0_In263115976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263115976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In263115976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In263115976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In263115976, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out263115976|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out263115976|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out263115976|, ~weak$$choice2~0=~weak$$choice2~0_In263115976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263115976} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:25:44,241 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:25:44,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In546651721 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In546651721 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In546651721 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In546651721 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out546651721| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out546651721| ~y$w_buff1_used~0_In546651721) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In546651721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546651721, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In546651721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546651721} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out546651721|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In546651721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546651721, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In546651721, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546651721} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:25:44,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1383415854 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1383415854 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1383415854 ~y$r_buff0_thd1~0_In1383415854)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1383415854 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1383415854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1383415854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1383415854, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1383415854|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1383415854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:25:44,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In-1635924607 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1635924607 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1635924607 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1635924607 256))) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-1635924607 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite29_Out-1635924607| |P1Thread1of1ForFork1_#t~ite30_Out-1635924607|))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) (= |P1Thread1of1ForFork1_#t~ite28_Out-1635924607| 0) .cse3 (or (not .cse4) .cse2) (= |P1Thread1of1ForFork1_#t~ite29_Out-1635924607| |P1Thread1of1ForFork1_#t~ite28_Out-1635924607|) .cse5)) (and (or (and (not .cse3) (= |P1Thread1of1ForFork1_#t~ite29_In-1635924607| |P1Thread1of1ForFork1_#t~ite29_Out-1635924607|) (= ~y$r_buff1_thd2~0_In-1635924607 |P1Thread1of1ForFork1_#t~ite30_Out-1635924607|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1635924607| ~y$r_buff1_thd2~0_In-1635924607) .cse3 (or .cse0 (and .cse6 .cse1) (and .cse6 .cse4)) .cse5)) (= |P1Thread1of1ForFork1_#t~ite28_In-1635924607| |P1Thread1of1ForFork1_#t~ite28_Out-1635924607|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1635924607, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1635924607|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1635924607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1635924607, ~weak$$choice2~0=~weak$$choice2~0_In-1635924607, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1635924607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1635924607} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1635924607, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1635924607|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1635924607|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1635924607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1635924607, ~weak$$choice2~0=~weak$$choice2~0_In-1635924607, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1635924607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1635924607} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:25:44,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1693434597 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1693434597 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1693434597 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1693434597 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1693434597| ~y$r_buff1_thd1~0_In1693434597) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1693434597| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1693434597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1693434597, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1693434597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1693434597} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1693434597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1693434597, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1693434597|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1693434597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1693434597} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:25:44,244 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:25:44,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In786691114 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In786691114 256) 0))) (or (and (= ~y~0_In786691114 |P1Thread1of1ForFork1_#t~ite32_Out786691114|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In786691114 |P1Thread1of1ForFork1_#t~ite32_Out786691114|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In786691114, ~y$w_buff1~0=~y$w_buff1~0_In786691114, ~y~0=~y~0_In786691114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In786691114} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In786691114, ~y$w_buff1~0=~y$w_buff1~0_In786691114, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out786691114|, ~y~0=~y~0_In786691114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In786691114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:25:44,245 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:25:44,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1452591431 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1452591431 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1452591431|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1452591431 |P1Thread1of1ForFork1_#t~ite34_Out-1452591431|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452591431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1452591431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452591431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1452591431, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1452591431|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:25:44,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-995717352 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-995717352 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-995717352 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-995717352 256) 0))) (or (and (= ~y$w_buff1_used~0_In-995717352 |P1Thread1of1ForFork1_#t~ite35_Out-995717352|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-995717352|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-995717352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995717352, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-995717352, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995717352} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-995717352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995717352, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-995717352, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-995717352|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995717352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:25:44,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-85456487 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-85456487 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-85456487| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-85456487 |P1Thread1of1ForFork1_#t~ite36_Out-85456487|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-85456487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85456487} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-85456487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85456487, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-85456487|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:25:44,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In686268390 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In686268390 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In686268390 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In686268390 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In686268390 |P1Thread1of1ForFork1_#t~ite37_Out686268390|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out686268390|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686268390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686268390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686268390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686268390} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686268390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686268390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686268390, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out686268390|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686268390} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:25:44,248 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:25:44,248 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:25:44,249 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:25:44,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In523974560 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In523974560 256)))) (or (and (= ~y$w_buff1~0_In523974560 |ULTIMATE.start_main_#t~ite40_Out523974560|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In523974560 |ULTIMATE.start_main_#t~ite40_Out523974560|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In523974560, ~y~0=~y~0_In523974560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In523974560, ~y$w_buff1_used~0=~y$w_buff1_used~0_In523974560} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out523974560|, ~y$w_buff1~0=~y$w_buff1~0_In523974560, ~y~0=~y~0_In523974560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In523974560, ~y$w_buff1_used~0=~y$w_buff1_used~0_In523974560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:25:44,249 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:25:44,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1059114475 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1059114475 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1059114475|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1059114475 |ULTIMATE.start_main_#t~ite42_Out1059114475|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1059114475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059114475} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1059114475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059114475, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1059114475|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:25:44,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1916604621 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1916604621 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1916604621 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1916604621 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1916604621|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1916604621 |ULTIMATE.start_main_#t~ite43_Out-1916604621|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916604621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1916604621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1916604621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916604621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916604621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1916604621, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1916604621|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1916604621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916604621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:25:44,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1005692537 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1005692537 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1005692537 |ULTIMATE.start_main_#t~ite44_Out1005692537|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1005692537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1005692537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1005692537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1005692537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1005692537, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1005692537|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:25:44,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In307773072 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In307773072 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In307773072 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In307773072 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out307773072| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out307773072| ~y$r_buff1_thd0~0_In307773072)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In307773072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In307773072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In307773072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In307773072} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In307773072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In307773072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In307773072, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out307773072|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In307773072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:25:44,252 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:25:44,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:25:44 BasicIcfg [2019-12-27 21:25:44,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:25:44,324 INFO L168 Benchmark]: Toolchain (without parser) took 14500.41 ms. Allocated memory was 140.5 MB in the beginning and 692.1 MB in the end (delta: 551.6 MB). Free memory was 102.2 MB in the beginning and 383.7 MB in the end (delta: -281.5 MB). Peak memory consumption was 270.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,325 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.50 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 158.4 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.7 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:25:44,330 INFO L168 Benchmark]: Boogie Preprocessor took 39.64 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,330 INFO L168 Benchmark]: RCFGBuilder took 833.42 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,331 INFO L168 Benchmark]: TraceAbstraction took 12815.12 ms. Allocated memory was 203.9 MB in the beginning and 692.1 MB in the end (delta: 488.1 MB). Free memory was 108.9 MB in the beginning and 383.7 MB in the end (delta: -274.8 MB). Peak memory consumption was 213.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:44,342 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.50 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 158.4 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.7 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.64 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.42 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12815.12 ms. Allocated memory was 203.9 MB in the beginning and 692.1 MB in the end (delta: 488.1 MB). Free memory was 108.9 MB in the beginning and 383.7 MB in the end (delta: -274.8 MB). Peak memory consumption was 213.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 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(&t1287, ((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(&t1288, ((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: 12.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1511 SDtfs, 1717 SDslu, 3378 SDs, 0 SdLazy, 1740 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s 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: 2.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 6656 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 41838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...