/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:51:18,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:51:18,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:51:18,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:51:18,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:51:18,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:51:18,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:51:18,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:51:18,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:51:18,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:51:18,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:51:18,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:51:18,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:51:18,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:51:18,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:51:18,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:51:18,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:51:18,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:51:18,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:51:18,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:51:18,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:51:18,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:51:18,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:51:18,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:51:18,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:51:18,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:51:18,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:51:18,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:51:18,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:51:18,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:51:18,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:51:18,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:51:18,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:51:18,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:51:18,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:51:18,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:51:18,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:51:18,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:51:18,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:51:18,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:51:18,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:51:18,642 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.epf [2019-12-27 06:51:18,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:51:18,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:51:18,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:51:18,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:51:18,659 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:51:18,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:51:18,659 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:51:18,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:51:18,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:51:18,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:51:18,661 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:51:18,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:51:18,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:51:18,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:51:18,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:51:18,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:51:18,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:51:18,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:51:18,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:51:18,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:51:18,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:51:18,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:51:18,663 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:51:18,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:51:18,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:51:18,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:51:18,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:51:18,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:51:18,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:51:18,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:51:18,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt.i [2019-12-27 06:51:19,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08856c5b1/067270987e66458193e6473e330bfbd9/FLAG78038d05b [2019-12-27 06:51:19,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:51:19,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt.i [2019-12-27 06:51:19,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08856c5b1/067270987e66458193e6473e330bfbd9/FLAG78038d05b [2019-12-27 06:51:19,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08856c5b1/067270987e66458193e6473e330bfbd9 [2019-12-27 06:51:19,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:51:19,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:51:19,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:51:19,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:51:19,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:51:19,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:19" (1/1) ... [2019-12-27 06:51:19,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:19, skipping insertion in model container [2019-12-27 06:51:19,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:19" (1/1) ... [2019-12-27 06:51:19,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:51:19,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:51:20,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:51:20,487 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:51:20,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:51:20,621 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:51:20,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20 WrapperNode [2019-12-27 06:51:20,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:51:20,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:51:20,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:51:20,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:51:20,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:51:20,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:51:20,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:51:20,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:51:20,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (1/1) ... [2019-12-27 06:51:20,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:51:20,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:51:20,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:51:20,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:51:20,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (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 06:51:20,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:51:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:51:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:51:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:51:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:51:20,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:51:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:51:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:51:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:51:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:51:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:51:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:51:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:51:20,786 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 06:51:21,513 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:51:21,513 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:51:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:21 BoogieIcfgContainer [2019-12-27 06:51:21,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:51:21,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:51:21,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:51:21,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:51:21,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:51:19" (1/3) ... [2019-12-27 06:51:21,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474eff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:21, skipping insertion in model container [2019-12-27 06:51:21,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:20" (2/3) ... [2019-12-27 06:51:21,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474eff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:21, skipping insertion in model container [2019-12-27 06:51:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:21" (3/3) ... [2019-12-27 06:51:21,525 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt.i [2019-12-27 06:51:21,535 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:51:21,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:51:21,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:51:21,546 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:51:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,628 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,628 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,628 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:21,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:51:21,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:51:21,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:51:21,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:51:21,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:51:21,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:51:21,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:51:21,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:51:21,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:51:21,713 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 06:51:21,730 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 06:51:21,845 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 06:51:21,846 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:51:21,864 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:51:21,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 06:51:21,962 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 06:51:21,963 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:51:21,971 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:51:21,986 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 06:51:21,988 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:51:25,493 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:51:25,629 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:51:25,662 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42778 [2019-12-27 06:51:25,662 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-27 06:51:25,665 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 06:51:26,466 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-27 06:51:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-27 06:51:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:51:26,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:26,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:26,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash 209995860, now seen corresponding path program 1 times [2019-12-27 06:51:26,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:26,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238359517] [2019-12-27 06:51:26,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:26,740 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 06:51:26,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238359517] [2019-12-27 06:51:26,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:26,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:51:26,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634977710] [2019-12-27 06:51:26,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:26,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:26,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:26,766 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-27 06:51:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:27,290 INFO L93 Difference]: Finished difference Result 13958 states and 53420 transitions. [2019-12-27 06:51:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:27,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:51:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:27,480 INFO L225 Difference]: With dead ends: 13958 [2019-12-27 06:51:27,481 INFO L226 Difference]: Without dead ends: 13126 [2019-12-27 06:51:27,482 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 06:51:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2019-12-27 06:51:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 13126. [2019-12-27 06:51:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13126 states. [2019-12-27 06:51:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13126 states to 13126 states and 50158 transitions. [2019-12-27 06:51:28,876 INFO L78 Accepts]: Start accepts. Automaton has 13126 states and 50158 transitions. Word has length 7 [2019-12-27 06:51:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:28,879 INFO L462 AbstractCegarLoop]: Abstraction has 13126 states and 50158 transitions. [2019-12-27 06:51:28,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13126 states and 50158 transitions. [2019-12-27 06:51:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:51:28,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:28,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:28,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1116254603, now seen corresponding path program 1 times [2019-12-27 06:51:28,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:28,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636515506] [2019-12-27 06:51:28,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:28,999 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 06:51:28,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636515506] [2019-12-27 06:51:29,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:29,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:29,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60866330] [2019-12-27 06:51:29,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:29,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:29,002 INFO L87 Difference]: Start difference. First operand 13126 states and 50158 transitions. Second operand 3 states. [2019-12-27 06:51:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:29,148 INFO L93 Difference]: Finished difference Result 7844 states and 26213 transitions. [2019-12-27 06:51:29,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:29,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:51:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:29,183 INFO L225 Difference]: With dead ends: 7844 [2019-12-27 06:51:29,184 INFO L226 Difference]: Without dead ends: 7844 [2019-12-27 06:51:29,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 06:51:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2019-12-27 06:51:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7844. [2019-12-27 06:51:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7844 states. [2019-12-27 06:51:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7844 states to 7844 states and 26213 transitions. [2019-12-27 06:51:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7844 states and 26213 transitions. Word has length 13 [2019-12-27 06:51:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:29,449 INFO L462 AbstractCegarLoop]: Abstraction has 7844 states and 26213 transitions. [2019-12-27 06:51:29,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 7844 states and 26213 transitions. [2019-12-27 06:51:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:51:29,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:29,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:29,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash -344203735, now seen corresponding path program 1 times [2019-12-27 06:51:29,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:29,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640200748] [2019-12-27 06:51:29,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:29,524 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 06:51:29,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640200748] [2019-12-27 06:51:29,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:29,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:29,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527284457] [2019-12-27 06:51:29,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:29,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:29,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:29,527 INFO L87 Difference]: Start difference. First operand 7844 states and 26213 transitions. Second operand 4 states. [2019-12-27 06:51:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:29,566 INFO L93 Difference]: Finished difference Result 1804 states and 4854 transitions. [2019-12-27 06:51:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:29,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:51:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:29,572 INFO L225 Difference]: With dead ends: 1804 [2019-12-27 06:51:29,572 INFO L226 Difference]: Without dead ends: 1804 [2019-12-27 06:51:29,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-27 06:51:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2019-12-27 06:51:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-27 06:51:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4854 transitions. [2019-12-27 06:51:29,615 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4854 transitions. Word has length 14 [2019-12-27 06:51:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:29,615 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 4854 transitions. [2019-12-27 06:51:29,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4854 transitions. [2019-12-27 06:51:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:51:29,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:29,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:29,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1665710889, now seen corresponding path program 1 times [2019-12-27 06:51:29,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:29,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718725934] [2019-12-27 06:51:29,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:29,709 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 06:51:29,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718725934] [2019-12-27 06:51:29,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:29,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:29,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575125659] [2019-12-27 06:51:29,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:29,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:29,715 INFO L87 Difference]: Start difference. First operand 1804 states and 4854 transitions. Second operand 4 states. [2019-12-27 06:51:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:29,983 INFO L93 Difference]: Finished difference Result 2487 states and 6609 transitions. [2019-12-27 06:51:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:29,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:51:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:29,991 INFO L225 Difference]: With dead ends: 2487 [2019-12-27 06:51:29,991 INFO L226 Difference]: Without dead ends: 2487 [2019-12-27 06:51:29,991 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 06:51:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-12-27 06:51:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2335. [2019-12-27 06:51:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-27 06:51:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 6271 transitions. [2019-12-27 06:51:30,056 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 6271 transitions. Word has length 16 [2019-12-27 06:51:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,057 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 6271 transitions. [2019-12-27 06:51:30,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 6271 transitions. [2019-12-27 06:51:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:51:30,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:30,059 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1665798557, now seen corresponding path program 1 times [2019-12-27 06:51:30,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329987998] [2019-12-27 06:51:30,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:30,172 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 06:51:30,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329987998] [2019-12-27 06:51:30,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:30,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:30,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193462256] [2019-12-27 06:51:30,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:30,175 INFO L87 Difference]: Start difference. First operand 2335 states and 6271 transitions. Second operand 4 states. [2019-12-27 06:51:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:30,341 INFO L93 Difference]: Finished difference Result 2822 states and 7464 transitions. [2019-12-27 06:51:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:30,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:51:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:30,347 INFO L225 Difference]: With dead ends: 2822 [2019-12-27 06:51:30,347 INFO L226 Difference]: Without dead ends: 2822 [2019-12-27 06:51:30,348 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 06:51:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-12-27 06:51:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2176. [2019-12-27 06:51:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-12-27 06:51:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 5796 transitions. [2019-12-27 06:51:30,404 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 5796 transitions. Word has length 16 [2019-12-27 06:51:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,404 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 5796 transitions. [2019-12-27 06:51:30,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 5796 transitions. [2019-12-27 06:51:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:51:30,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,408 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] [2019-12-27 06:51:30,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 966323881, now seen corresponding path program 1 times [2019-12-27 06:51:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663030048] [2019-12-27 06:51:30,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:30,460 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 06:51:30,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663030048] [2019-12-27 06:51:30,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:30,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:30,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195032445] [2019-12-27 06:51:30,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:30,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:30,462 INFO L87 Difference]: Start difference. First operand 2176 states and 5796 transitions. Second operand 3 states. [2019-12-27 06:51:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:30,487 INFO L93 Difference]: Finished difference Result 3606 states and 9266 transitions. [2019-12-27 06:51:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:30,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 06:51:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:30,495 INFO L225 Difference]: With dead ends: 3606 [2019-12-27 06:51:30,496 INFO L226 Difference]: Without dead ends: 2278 [2019-12-27 06:51:30,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 06:51:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-12-27 06:51:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2248. [2019-12-27 06:51:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-27 06:51:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5362 transitions. [2019-12-27 06:51:30,554 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5362 transitions. Word has length 29 [2019-12-27 06:51:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,555 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 5362 transitions. [2019-12-27 06:51:30,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5362 transitions. [2019-12-27 06:51:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:51:30,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,560 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] [2019-12-27 06:51:30,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1536908682, now seen corresponding path program 1 times [2019-12-27 06:51:30,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940111999] [2019-12-27 06:51:30,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:30,629 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 06:51:30,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940111999] [2019-12-27 06:51:30,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:30,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:30,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094196134] [2019-12-27 06:51:30,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:30,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:30,632 INFO L87 Difference]: Start difference. First operand 2248 states and 5362 transitions. Second operand 3 states. [2019-12-27 06:51:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:30,687 INFO L93 Difference]: Finished difference Result 3207 states and 7534 transitions. [2019-12-27 06:51:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:30,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 06:51:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:30,695 INFO L225 Difference]: With dead ends: 3207 [2019-12-27 06:51:30,695 INFO L226 Difference]: Without dead ends: 3207 [2019-12-27 06:51:30,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:51:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-12-27 06:51:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2421. [2019-12-27 06:51:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-12-27 06:51:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 5716 transitions. [2019-12-27 06:51:30,765 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 5716 transitions. Word has length 29 [2019-12-27 06:51:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,766 INFO L462 AbstractCegarLoop]: Abstraction has 2421 states and 5716 transitions. [2019-12-27 06:51:30,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 5716 transitions. [2019-12-27 06:51:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:51:30,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,773 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] [2019-12-27 06:51:30,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1529330804, now seen corresponding path program 1 times [2019-12-27 06:51:30,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304357933] [2019-12-27 06:51:30,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:30,878 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 06:51:30,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304357933] [2019-12-27 06:51:30,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:30,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:30,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214226899] [2019-12-27 06:51:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:30,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:30,881 INFO L87 Difference]: Start difference. First operand 2421 states and 5716 transitions. Second operand 5 states. [2019-12-27 06:51:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:30,924 INFO L93 Difference]: Finished difference Result 1464 states and 3319 transitions. [2019-12-27 06:51:30,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:30,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 06:51:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:30,930 INFO L225 Difference]: With dead ends: 1464 [2019-12-27 06:51:30,930 INFO L226 Difference]: Without dead ends: 748 [2019-12-27 06:51:30,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-12-27 06:51:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 708. [2019-12-27 06:51:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-12-27 06:51:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1567 transitions. [2019-12-27 06:51:30,946 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1567 transitions. Word has length 29 [2019-12-27 06:51:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:30,948 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1567 transitions. [2019-12-27 06:51:30,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1567 transitions. [2019-12-27 06:51:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:51:30,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:30,953 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] [2019-12-27 06:51:30,953 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash 781934548, now seen corresponding path program 1 times [2019-12-27 06:51:30,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:30,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947782008] [2019-12-27 06:51:30,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:31,063 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 06:51:31,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947782008] [2019-12-27 06:51:31,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:31,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:31,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810687737] [2019-12-27 06:51:31,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:31,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:31,067 INFO L87 Difference]: Start difference. First operand 708 states and 1567 transitions. Second operand 7 states. [2019-12-27 06:51:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:31,405 INFO L93 Difference]: Finished difference Result 1886 states and 4119 transitions. [2019-12-27 06:51:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:51:31,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 06:51:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:31,408 INFO L225 Difference]: With dead ends: 1886 [2019-12-27 06:51:31,408 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 06:51:31,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:51:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 06:51:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 816. [2019-12-27 06:51:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-27 06:51:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1802 transitions. [2019-12-27 06:51:31,427 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1802 transitions. Word has length 44 [2019-12-27 06:51:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:31,427 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1802 transitions. [2019-12-27 06:51:31,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1802 transitions. [2019-12-27 06:51:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:51:31,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:31,430 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] [2019-12-27 06:51:31,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2142597012, now seen corresponding path program 2 times [2019-12-27 06:51:31,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245124969] [2019-12-27 06:51:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:31,619 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 06:51:31,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245124969] [2019-12-27 06:51:31,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:31,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:51:31,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807718964] [2019-12-27 06:51:31,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:51:31,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:31,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:51:31,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:51:31,621 INFO L87 Difference]: Start difference. First operand 816 states and 1802 transitions. Second operand 8 states. [2019-12-27 06:51:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:32,322 INFO L93 Difference]: Finished difference Result 999 states and 2084 transitions. [2019-12-27 06:51:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:51:32,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-27 06:51:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:32,325 INFO L225 Difference]: With dead ends: 999 [2019-12-27 06:51:32,325 INFO L226 Difference]: Without dead ends: 981 [2019-12-27 06:51:32,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:51:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-27 06:51:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 852. [2019-12-27 06:51:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-12-27 06:51:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1823 transitions. [2019-12-27 06:51:32,340 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1823 transitions. Word has length 44 [2019-12-27 06:51:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:32,341 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1823 transitions. [2019-12-27 06:51:32,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:51:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1823 transitions. [2019-12-27 06:51:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:51:32,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:32,343 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] [2019-12-27 06:51:32,344 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2074606822, now seen corresponding path program 1 times [2019-12-27 06:51:32,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:32,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425991663] [2019-12-27 06:51:32,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:32,389 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 06:51:32,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425991663] [2019-12-27 06:51:32,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:32,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:32,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005716380] [2019-12-27 06:51:32,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:32,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:32,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:32,393 INFO L87 Difference]: Start difference. First operand 852 states and 1823 transitions. Second operand 3 states. [2019-12-27 06:51:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:32,435 INFO L93 Difference]: Finished difference Result 1030 states and 2068 transitions. [2019-12-27 06:51:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:32,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:51:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:32,437 INFO L225 Difference]: With dead ends: 1030 [2019-12-27 06:51:32,437 INFO L226 Difference]: Without dead ends: 1030 [2019-12-27 06:51:32,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:51:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-27 06:51:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 890. [2019-12-27 06:51:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 06:51:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1802 transitions. [2019-12-27 06:51:32,452 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1802 transitions. Word has length 44 [2019-12-27 06:51:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:32,453 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1802 transitions. [2019-12-27 06:51:32,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1802 transitions. [2019-12-27 06:51:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:51:32,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:32,456 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] [2019-12-27 06:51:32,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1798984674, now seen corresponding path program 3 times [2019-12-27 06:51:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:32,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423226884] [2019-12-27 06:51:32,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:32,550 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 06:51:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423226884] [2019-12-27 06:51:32,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:32,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:32,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535203853] [2019-12-27 06:51:32,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:32,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:32,552 INFO L87 Difference]: Start difference. First operand 890 states and 1802 transitions. Second operand 3 states. [2019-12-27 06:51:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:32,566 INFO L93 Difference]: Finished difference Result 888 states and 1797 transitions. [2019-12-27 06:51:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:32,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:51:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:32,568 INFO L225 Difference]: With dead ends: 888 [2019-12-27 06:51:32,569 INFO L226 Difference]: Without dead ends: 888 [2019-12-27 06:51:32,570 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 06:51:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-12-27 06:51:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 766. [2019-12-27 06:51:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-12-27 06:51:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1577 transitions. [2019-12-27 06:51:32,582 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1577 transitions. Word has length 44 [2019-12-27 06:51:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:32,582 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1577 transitions. [2019-12-27 06:51:32,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1577 transitions. [2019-12-27 06:51:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:51:32,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:32,584 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] [2019-12-27 06:51:32,585 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1709517426, now seen corresponding path program 1 times [2019-12-27 06:51:32,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:32,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244648448] [2019-12-27 06:51:32,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:51:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:51:32,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:51:32,761 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:51:32,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1394~0.base_27|) (= v_~main$tmp_guard1~0_18 0) (= v_~y$r_buff0_thd2~0_65 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1394~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_10 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_27| 1)) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1394~0.offset_21| 0) (= v_~y$w_buff1_used~0_57 0) (= 0 v_~y$w_buff0_used~0_92) (= v_~x~0_17 0) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~y~0_22 0) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_27|) |v_ULTIMATE.start_main_~#t1394~0.offset_21| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_3|) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~y$r_buff1_thd2~0_43) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_27|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_21|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_~#t1394~0.base=|v_ULTIMATE.start_main_~#t1394~0.base_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t1394~0.offset=|v_ULTIMATE.start_main_~#t1394~0.offset_21|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_65, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_15|, ~y~0=v_~y~0_22, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1395~0.base, ULTIMATE.start_main_~#t1396~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1396~0.offset, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1394~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1395~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1394~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:51:32,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1395~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9|) |v_ULTIMATE.start_main_~#t1395~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1395~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1395~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1395~0.base_9| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_9|, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1395~0.offset, ULTIMATE.start_main_~#t1395~0.base] because there is no mapped edge [2019-12-27 06:51:32,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L812-1-->L814: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1396~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1396~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10|) |v_ULTIMATE.start_main_~#t1396~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1396~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1396~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1396~0.offset] because there is no mapped edge [2019-12-27 06:51:32,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~y$r_buff0_thd2~0_42 v_~y$r_buff1_thd2~0_22) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_15 1)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:51:32,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~x~0_6) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= 1 v_~z~0_7)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_7, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:51:32,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1522801909 256) 0))) (or (and .cse0 (= ~y$w_buff0~0_In1522801909 |P1Thread1of1ForFork1_#t~ite8_Out1522801909|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1522801909 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1522801909 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1522801909 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1522801909 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite8_Out1522801909| |P1Thread1of1ForFork1_#t~ite9_Out1522801909|)) (and (= |P1Thread1of1ForFork1_#t~ite8_In1522801909| |P1Thread1of1ForFork1_#t~ite8_Out1522801909|) (not .cse0) (= ~y$w_buff0~0_In1522801909 |P1Thread1of1ForFork1_#t~ite9_Out1522801909|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522801909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522801909, ~y$w_buff0~0=~y$w_buff0~0_In1522801909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522801909, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1522801909|, ~weak$$choice2~0=~weak$$choice2~0_In1522801909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522801909} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522801909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522801909, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1522801909|, ~y$w_buff0~0=~y$w_buff0~0_In1522801909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522801909, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1522801909|, ~weak$$choice2~0=~weak$$choice2~0_In1522801909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522801909} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:51:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L753-->L753-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In650185467 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In650185467 |P1Thread1of1ForFork1_#t~ite12_Out650185467|) (= |P1Thread1of1ForFork1_#t~ite11_In650185467| |P1Thread1of1ForFork1_#t~ite11_Out650185467|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out650185467| ~y$w_buff1~0_In650185467) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In650185467 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In650185467 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In650185467 256))) (= (mod ~y$w_buff0_used~0_In650185467 256) 0))) (= |P1Thread1of1ForFork1_#t~ite11_Out650185467| |P1Thread1of1ForFork1_#t~ite12_Out650185467|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In650185467, ~y$w_buff1~0=~y$w_buff1~0_In650185467, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650185467, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In650185467, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In650185467|, ~weak$$choice2~0=~weak$$choice2~0_In650185467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650185467} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In650185467, ~y$w_buff1~0=~y$w_buff1~0_In650185467, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650185467, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In650185467, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out650185467|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out650185467|, ~weak$$choice2~0=~weak$$choice2~0_In650185467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650185467} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:51:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:51:32,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 06:51:32,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-610945424 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-610945424 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-610945424| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-610945424| ~y$w_buff0_used~0_In-610945424)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-610945424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-610945424} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-610945424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-610945424, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-610945424|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:51:32,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1670010835 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1670010835 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1670010835 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1670010835 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out1670010835| ~y$w_buff1_used~0_In1670010835) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1670010835|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1670010835, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1670010835, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1670010835, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1670010835} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1670010835, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1670010835, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1670010835, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1670010835|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1670010835} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:51:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In907002970 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In907002970 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out907002970) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In907002970 ~y$r_buff0_thd3~0_Out907002970)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In907002970, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In907002970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In907002970, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out907002970|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out907002970} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:51:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1201023926 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1201023926 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1201023926 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1201023926 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1201023926 |P2Thread1of1ForFork2_#t~ite31_Out1201023926|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1201023926|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1201023926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1201023926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1201023926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1201023926} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1201023926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1201023926, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1201023926|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1201023926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1201023926} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:51:32,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:51:32,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:51:32,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1533595186 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1533595186 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In1533595186 |ULTIMATE.start_main_#t~ite35_Out1533595186|)) (and (= |ULTIMATE.start_main_#t~ite35_Out1533595186| ~y$w_buff1~0_In1533595186) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1533595186, ~y~0=~y~0_In1533595186, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1533595186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533595186} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1533595186, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1533595186|, ~y~0=~y~0_In1533595186, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1533595186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533595186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 06:51:32,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 06:51:32,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1901652852 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1901652852 256) 0))) (or (and (= ~y$w_buff0_used~0_In1901652852 |ULTIMATE.start_main_#t~ite37_Out1901652852|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out1901652852| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1901652852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1901652852} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1901652852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1901652852, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1901652852|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:51:32,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1123528361 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1123528361 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1123528361 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1123528361 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1123528361| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-1123528361| ~y$w_buff1_used~0_In-1123528361) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1123528361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1123528361, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1123528361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1123528361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1123528361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1123528361, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1123528361|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1123528361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1123528361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:51:32,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1564405805 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1564405805 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1564405805|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1564405805 |ULTIMATE.start_main_#t~ite39_Out1564405805|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1564405805, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1564405805} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1564405805, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1564405805|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1564405805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:51:32,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1388005306 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1388005306 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1388005306 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1388005306 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1388005306| ~y$r_buff1_thd0~0_In1388005306) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1388005306|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1388005306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1388005306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1388005306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388005306} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1388005306|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1388005306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1388005306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1388005306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388005306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:51:32,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_11) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard1~0_12 0) (= |v_ULTIMATE.start_main_#t~ite40_14| v_~y$r_buff1_thd0~0_16) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:51:32,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:51:32 BasicIcfg [2019-12-27 06:51:32,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:51:32,876 INFO L168 Benchmark]: Toolchain (without parser) took 12989.43 ms. Allocated memory was 141.6 MB in the beginning and 543.7 MB in the end (delta: 402.1 MB). Free memory was 100.7 MB in the beginning and 214.9 MB in the end (delta: -114.2 MB). Peak memory consumption was 287.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,877 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 141.6 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.09 ms. Allocated memory was 141.6 MB in the beginning and 201.9 MB in the end (delta: 60.3 MB). Free memory was 100.3 MB in the beginning and 157.5 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 201.9 MB. Free memory was 157.5 MB in the beginning and 154.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,879 INFO L168 Benchmark]: Boogie Preprocessor took 37.91 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,880 INFO L168 Benchmark]: RCFGBuilder took 793.86 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 109.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,881 INFO L168 Benchmark]: TraceAbstraction took 11358.39 ms. Allocated memory was 201.9 MB in the beginning and 543.7 MB in the end (delta: 341.8 MB). Free memory was 109.2 MB in the beginning and 214.9 MB in the end (delta: -105.7 MB). Peak memory consumption was 236.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:51:32,885 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 141.6 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.09 ms. Allocated memory was 141.6 MB in the beginning and 201.9 MB in the end (delta: 60.3 MB). Free memory was 100.3 MB in the beginning and 157.5 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 201.9 MB. Free memory was 157.5 MB in the beginning and 154.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.91 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.86 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 109.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11358.39 ms. Allocated memory was 201.9 MB in the beginning and 543.7 MB in the end (delta: 341.8 MB). Free memory was 109.2 MB in the beginning and 214.9 MB in the end (delta: -105.7 MB). Peak memory consumption was 236.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 151 ProgramPointsBefore, 75 ProgramPointsAfterwards, 176 TransitionsBefore, 84 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 4933 VarBasedMoverChecksPositive, 125 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42778 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L812] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L751] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L751] 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) [L752] 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)) [L753] 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)) [L754] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L754] 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)) [L755] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 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)) [L757] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L757] 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)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 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 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1415 SDtfs, 1193 SDslu, 2466 SDs, 0 SdLazy, 1162 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14534occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2477 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 32481 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...