/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:49:12,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:49:12,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:49:12,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:49:12,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:49:12,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:49:12,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:49:12,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:49:12,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:49:12,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:49:12,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:49:12,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:49:12,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:49:12,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:49:12,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:49:12,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:49:12,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:49:12,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:49:12,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:49:12,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:49:12,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:49:12,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:49:12,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:49:12,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:49:12,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:49:12,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:49:12,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:49:12,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:49:12,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:49:12,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:49:12,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:49:12,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:49:12,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:49:12,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:49:12,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:49:12,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:49:12,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:49:12,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:49:12,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:49:12,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:49:12,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:49:12,538 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-SemanticLbe-MCR.epf [2019-12-27 16:49:12,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:49:12,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:49:12,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:49:12,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:49:12,555 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:49:12,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:49:12,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:49:12,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:49:12,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:49:12,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:49:12,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:49:12,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:49:12,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:49:12,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:49:12,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:49:12,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:49:12,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:49:12,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:49:12,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:49:12,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:49:12,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:49:12,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:49:12,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:49:12,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:49:12,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:49:12,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:49:12,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:49:12,559 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:49:12,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:49:12,560 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:49:12,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:49:12,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:49:12,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:49:12,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:49:12,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:49:12,844 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:49:12,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i [2019-12-27 16:49:12,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539bbbc6c/75eac944aff04426b9164fd045cabe1d/FLAG2ba0a9acf [2019-12-27 16:49:13,414 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:49:13,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt.i [2019-12-27 16:49:13,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539bbbc6c/75eac944aff04426b9164fd045cabe1d/FLAG2ba0a9acf [2019-12-27 16:49:13,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539bbbc6c/75eac944aff04426b9164fd045cabe1d [2019-12-27 16:49:13,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:49:13,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:49:13,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:13,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:49:13,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:49:13,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:13" (1/1) ... [2019-12-27 16:49:13,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:13, skipping insertion in model container [2019-12-27 16:49:13,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:13" (1/1) ... [2019-12-27 16:49:13,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:49:13,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:49:14,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:14,418 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:49:14,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:14,596 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:49:14,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14 WrapperNode [2019-12-27 16:49:14,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:14,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:14,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:49:14,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:49:14,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:14,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:49:14,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:49:14,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:49:14,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (1/1) ... [2019-12-27 16:49:14,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:49:14,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:49:14,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:49:14,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:49:14,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (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 16:49:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:49:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:49:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:49:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:49:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:49:14,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:49:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:49:14,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:49:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:49:14,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:49:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:49:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:49:14,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:49:14,762 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 16:49:15,470 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:49:15,470 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:49:15,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:15 BoogieIcfgContainer [2019-12-27 16:49:15,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:49:15,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:49:15,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:49:15,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:49:15,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:49:13" (1/3) ... [2019-12-27 16:49:15,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c71dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:15, skipping insertion in model container [2019-12-27 16:49:15,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:14" (2/3) ... [2019-12-27 16:49:15,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c71dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:15, skipping insertion in model container [2019-12-27 16:49:15,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:15" (3/3) ... [2019-12-27 16:49:15,481 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt.i [2019-12-27 16:49:15,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:49:15,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:49:15,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:49:15,497 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:49:15,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,560 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,560 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,594 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,599 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,600 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:15,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:49:15,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:49:15,635 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:49:15,635 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:49:15,635 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:49:15,635 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:49:15,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:49:15,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:49:15,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:49:15,651 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-27 16:49:15,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-27 16:49:15,742 INFO L132 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-27 16:49:15,742 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:15,759 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 16:49:15,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-27 16:49:15,847 INFO L132 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-27 16:49:15,848 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:15,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 16:49:15,870 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 16:49:15,871 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:49:20,772 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:49:20,903 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:49:20,930 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-12-27 16:49:20,930 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:49:20,933 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-12-27 16:49:21,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-12-27 16:49:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-12-27 16:49:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:49:21,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:21,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:21,738 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 16:49:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-12-27 16:49:21,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:21,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124304646] [2019-12-27 16:49:21,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:22,053 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 16:49:22,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124304646] [2019-12-27 16:49:22,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:22,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:22,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334358928] [2019-12-27 16:49:22,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:22,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:22,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:49:22,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:22,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:22,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:22,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:22,099 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-12-27 16:49:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:22,444 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-12-27 16:49:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:22,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:49:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:22,634 INFO L225 Difference]: With dead ends: 11966 [2019-12-27 16:49:22,634 INFO L226 Difference]: Without dead ends: 11270 [2019-12-27 16:49:22,636 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 16:49:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-27 16:49:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-12-27 16:49:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-12-27 16:49:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-12-27 16:49:23,841 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-12-27 16:49:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:23,843 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-12-27 16:49:23,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-12-27 16:49:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:49:23,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:23,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:23,856 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 16:49:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-12-27 16:49:23,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:23,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478631266] [2019-12-27 16:49:23,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:23,968 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 16:49:23,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478631266] [2019-12-27 16:49:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:23,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468481265] [2019-12-27 16:49:23,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:23,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:23,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:49:23,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:23,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:23,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:23,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:23,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:23,983 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 3 states. [2019-12-27 16:49:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:24,127 INFO L93 Difference]: Finished difference Result 6790 states and 22693 transitions. [2019-12-27 16:49:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:49:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:24,179 INFO L225 Difference]: With dead ends: 6790 [2019-12-27 16:49:24,179 INFO L226 Difference]: Without dead ends: 6790 [2019-12-27 16:49:24,181 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 16:49:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-27 16:49:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6790. [2019-12-27 16:49:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2019-12-27 16:49:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 22693 transitions. [2019-12-27 16:49:24,443 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 22693 transitions. Word has length 13 [2019-12-27 16:49:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:24,443 INFO L462 AbstractCegarLoop]: Abstraction has 6790 states and 22693 transitions. [2019-12-27 16:49:24,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 22693 transitions. [2019-12-27 16:49:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:24,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:24,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:24,446 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 16:49:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 369435328, now seen corresponding path program 1 times [2019-12-27 16:49:24,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:24,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754912374] [2019-12-27 16:49:24,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:24,527 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 16:49:24,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754912374] [2019-12-27 16:49:24,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:24,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:24,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261320153] [2019-12-27 16:49:24,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:24,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:24,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 16:49:24,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:24,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:24,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:24,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:24,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:24,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:24,579 INFO L87 Difference]: Start difference. First operand 6790 states and 22693 transitions. Second operand 5 states. [2019-12-27 16:49:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:24,664 INFO L93 Difference]: Finished difference Result 1617 states and 4342 transitions. [2019-12-27 16:49:24,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:49:24,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:49:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:24,670 INFO L225 Difference]: With dead ends: 1617 [2019-12-27 16:49:24,671 INFO L226 Difference]: Without dead ends: 1617 [2019-12-27 16:49:24,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:49:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-12-27 16:49:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2019-12-27 16:49:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-12-27 16:49:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 4342 transitions. [2019-12-27 16:49:24,717 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 4342 transitions. Word has length 14 [2019-12-27 16:49:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:24,718 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 4342 transitions. [2019-12-27 16:49:24,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 4342 transitions. [2019-12-27 16:49:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:49:24,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:24,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:24,720 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 16:49:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-12-27 16:49:24,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:24,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252261794] [2019-12-27 16:49:24,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:24,785 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 16:49:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252261794] [2019-12-27 16:49:24,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:24,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737590253] [2019-12-27 16:49:24,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:24,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:24,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:49:24,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:24,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:24,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:24,840 INFO L87 Difference]: Start difference. First operand 1617 states and 4342 transitions. Second operand 5 states. [2019-12-27 16:49:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:24,977 INFO L93 Difference]: Finished difference Result 2388 states and 6272 transitions. [2019-12-27 16:49:24,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:24,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:49:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:24,986 INFO L225 Difference]: With dead ends: 2388 [2019-12-27 16:49:24,986 INFO L226 Difference]: Without dead ends: 2388 [2019-12-27 16:49:24,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-27 16:49:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1795. [2019-12-27 16:49:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-27 16:49:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 4765 transitions. [2019-12-27 16:49:25,175 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 4765 transitions. Word has length 16 [2019-12-27 16:49:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:25,176 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 4765 transitions. [2019-12-27 16:49:25,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 4765 transitions. [2019-12-27 16:49:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:49:25,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:25,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:25,177 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 16:49:25,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-12-27 16:49:25,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:25,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799449632] [2019-12-27 16:49:25,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:25,229 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 16:49:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799449632] [2019-12-27 16:49:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:25,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:25,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014035647] [2019-12-27 16:49:25,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:25,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:25,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:49:25,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:25,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:25,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:25,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:25,262 INFO L87 Difference]: Start difference. First operand 1795 states and 4765 transitions. Second operand 5 states. [2019-12-27 16:49:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:25,487 INFO L93 Difference]: Finished difference Result 2341 states and 6074 transitions. [2019-12-27 16:49:25,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:25,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:49:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:25,494 INFO L225 Difference]: With dead ends: 2341 [2019-12-27 16:49:25,494 INFO L226 Difference]: Without dead ends: 2341 [2019-12-27 16:49:25,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-12-27 16:49:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2141. [2019-12-27 16:49:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-12-27 16:49:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 5644 transitions. [2019-12-27 16:49:25,558 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 5644 transitions. Word has length 16 [2019-12-27 16:49:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:25,558 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 5644 transitions. [2019-12-27 16:49:25,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 5644 transitions. [2019-12-27 16:49:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:49:25,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:25,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:25,560 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 16:49:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-12-27 16:49:25,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:25,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377398145] [2019-12-27 16:49:25,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:25,645 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 16:49:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377398145] [2019-12-27 16:49:25,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:25,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:25,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691338025] [2019-12-27 16:49:25,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:25,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:25,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:49:25,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:25,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:25,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:25,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:25,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:25,680 INFO L87 Difference]: Start difference. First operand 2141 states and 5644 transitions. Second operand 5 states. [2019-12-27 16:49:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:25,934 INFO L93 Difference]: Finished difference Result 2723 states and 7055 transitions. [2019-12-27 16:49:25,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:25,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:49:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:25,942 INFO L225 Difference]: With dead ends: 2723 [2019-12-27 16:49:25,942 INFO L226 Difference]: Without dead ends: 2723 [2019-12-27 16:49:25,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2019-12-27 16:49:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2242. [2019-12-27 16:49:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-27 16:49:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5899 transitions. [2019-12-27 16:49:26,005 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5899 transitions. Word has length 16 [2019-12-27 16:49:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:26,006 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5899 transitions. [2019-12-27 16:49:26,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5899 transitions. [2019-12-27 16:49:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:49:26,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:26,011 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 16:49:26,011 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 16:49:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-12-27 16:49:26,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:26,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75896993] [2019-12-27 16:49:26,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:26,112 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 16:49:26,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75896993] [2019-12-27 16:49:26,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:26,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:49:26,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829038603] [2019-12-27 16:49:26,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:26,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:26,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 197 transitions. [2019-12-27 16:49:26,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:26,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:49:26,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:49:26,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:49:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:49:26,325 INFO L87 Difference]: Start difference. First operand 2242 states and 5899 transitions. Second operand 8 states. [2019-12-27 16:49:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:26,705 INFO L93 Difference]: Finished difference Result 1408 states and 3723 transitions. [2019-12-27 16:49:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:26,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 16:49:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:26,709 INFO L225 Difference]: With dead ends: 1408 [2019-12-27 16:49:26,709 INFO L226 Difference]: Without dead ends: 1385 [2019-12-27 16:49:26,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:49:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-12-27 16:49:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1293. [2019-12-27 16:49:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2019-12-27 16:49:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 3473 transitions. [2019-12-27 16:49:26,743 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 3473 transitions. Word has length 29 [2019-12-27 16:49:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:26,743 INFO L462 AbstractCegarLoop]: Abstraction has 1293 states and 3473 transitions. [2019-12-27 16:49:26,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:49:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 3473 transitions. [2019-12-27 16:49:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:49:26,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:26,751 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 16:49:26,751 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 16:49:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash -651252201, now seen corresponding path program 1 times [2019-12-27 16:49:26,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:26,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017996373] [2019-12-27 16:49:26,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:26,880 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 16:49:26,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017996373] [2019-12-27 16:49:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:26,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:26,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661807345] [2019-12-27 16:49:26,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:26,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:26,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 104 transitions. [2019-12-27 16:49:26,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:27,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:49:27,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:49:27,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:27,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:49:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:27,049 INFO L87 Difference]: Start difference. First operand 1293 states and 3473 transitions. Second operand 6 states. [2019-12-27 16:49:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:27,338 INFO L93 Difference]: Finished difference Result 2657 states and 7063 transitions. [2019-12-27 16:49:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:49:27,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 16:49:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:27,341 INFO L225 Difference]: With dead ends: 2657 [2019-12-27 16:49:27,341 INFO L226 Difference]: Without dead ends: 905 [2019-12-27 16:49:27,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:49:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-27 16:49:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 801. [2019-12-27 16:49:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-12-27 16:49:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1755 transitions. [2019-12-27 16:49:27,359 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1755 transitions. Word has length 44 [2019-12-27 16:49:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:27,360 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1755 transitions. [2019-12-27 16:49:27,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:49:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1755 transitions. [2019-12-27 16:49:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:49:27,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:27,363 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 16:49:27,363 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 16:49:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1022585143, now seen corresponding path program 2 times [2019-12-27 16:49:27,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:27,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044967722] [2019-12-27 16:49:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:27,436 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 16:49:27,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044967722] [2019-12-27 16:49:27,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:27,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:27,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150264420] [2019-12-27 16:49:27,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:27,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:27,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 82 transitions. [2019-12-27 16:49:27,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:27,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:27,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:27,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:27,495 INFO L87 Difference]: Start difference. First operand 801 states and 1755 transitions. Second operand 5 states. [2019-12-27 16:49:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:27,520 INFO L93 Difference]: Finished difference Result 1289 states and 2849 transitions. [2019-12-27 16:49:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:49:27,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 16:49:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:27,522 INFO L225 Difference]: With dead ends: 1289 [2019-12-27 16:49:27,522 INFO L226 Difference]: Without dead ends: 509 [2019-12-27 16:49:27,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-12-27 16:49:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-12-27 16:49:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-12-27 16:49:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1127 transitions. [2019-12-27 16:49:27,533 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1127 transitions. Word has length 44 [2019-12-27 16:49:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:27,533 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 1127 transitions. [2019-12-27 16:49:27,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1127 transitions. [2019-12-27 16:49:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:49:27,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:27,535 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 16:49:27,536 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 16:49:27,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash -891161673, now seen corresponding path program 3 times [2019-12-27 16:49:27,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:27,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820538748] [2019-12-27 16:49:27,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:27,642 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 16:49:27,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820538748] [2019-12-27 16:49:27,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:27,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:27,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744206716] [2019-12-27 16:49:27,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:27,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:27,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 101 transitions. [2019-12-27 16:49:27,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:27,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:27,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:27,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:27,764 INFO L87 Difference]: Start difference. First operand 509 states and 1127 transitions. Second operand 3 states. [2019-12-27 16:49:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:27,777 INFO L93 Difference]: Finished difference Result 507 states and 1122 transitions. [2019-12-27 16:49:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:27,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 16:49:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:27,780 INFO L225 Difference]: With dead ends: 507 [2019-12-27 16:49:27,780 INFO L226 Difference]: Without dead ends: 507 [2019-12-27 16:49:27,781 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 16:49:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-27 16:49:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-12-27 16:49:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 16:49:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1122 transitions. [2019-12-27 16:49:27,796 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1122 transitions. Word has length 44 [2019-12-27 16:49:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:27,796 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1122 transitions. [2019-12-27 16:49:27,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1122 transitions. [2019-12-27 16:49:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 16:49:27,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:27,799 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 16:49:27,799 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 16:49:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 1 times [2019-12-27 16:49:27,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:27,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694423595] [2019-12-27 16:49:27,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:27,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:49:27,958 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:49:27,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t922~0.base_38| 4)) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= 0 |v_ULTIMATE.start_main_~#t922~0.offset_26|) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t922~0.base_38|) |v_ULTIMATE.start_main_~#t922~0.offset_26| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38| 1)) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t922~0.base_38|)) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_32|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ULTIMATE.start_main_~#t922~0.offset=|v_ULTIMATE.start_main_~#t922~0.offset_26|, ~y~0=v_~y~0_134, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_19|, ULTIMATE.start_main_~#t922~0.base=|v_ULTIMATE.start_main_~#t922~0.base_38|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t924~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t922~0.offset, ~y~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t923~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t923~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, ULTIMATE.start_main_~#t922~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:49:27,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) |v_ULTIMATE.start_main_~#t923~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t923~0.base_13| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t923~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t923~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t923~0.offset_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t923~0.base_13| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t923~0.offset=|v_ULTIMATE.start_main_~#t923~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t923~0.base=|v_ULTIMATE.start_main_~#t923~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t923~0.offset, #length, ULTIMATE.start_main_~#t923~0.base] because there is no mapped edge [2019-12-27 16:49:27,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (not (= |v_ULTIMATE.start_main_~#t924~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t924~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t924~0.base_12| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t924~0.base_12|) |v_ULTIMATE.start_main_~#t924~0.offset_10| 2))) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t924~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t924~0.base=|v_ULTIMATE.start_main_~#t924~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t924~0.offset=|v_ULTIMATE.start_main_~#t924~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t924~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t924~0.offset, #length] because there is no mapped edge [2019-12-27 16:49:27,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~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_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:49:27,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:49:27,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In443995264 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In443995264 |P1Thread1of1ForFork1_#t~ite9_Out443995264|) (= |P1Thread1of1ForFork1_#t~ite8_In443995264| |P1Thread1of1ForFork1_#t~ite8_Out443995264|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out443995264| |P1Thread1of1ForFork1_#t~ite8_Out443995264|) (= ~y$w_buff0~0_In443995264 |P1Thread1of1ForFork1_#t~ite8_Out443995264|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In443995264 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In443995264 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In443995264 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In443995264 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443995264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443995264, ~y$w_buff0~0=~y$w_buff0~0_In443995264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443995264, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In443995264|, ~weak$$choice2~0=~weak$$choice2~0_In443995264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443995264} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443995264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443995264, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out443995264|, ~y$w_buff0~0=~y$w_buff0~0_In443995264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443995264, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out443995264|, ~weak$$choice2~0=~weak$$choice2~0_In443995264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443995264} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:49:27,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_22} 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 16:49:27,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1820800764 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1820800764 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-1820800764 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1820800764 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1820800764 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-1820800764| ~y$r_buff1_thd2~0_In-1820800764) .cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1820800764| |P1Thread1of1ForFork1_#t~ite23_Out-1820800764|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In-1820800764| |P1Thread1of1ForFork1_#t~ite23_Out-1820800764|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out-1820800764| ~y$r_buff1_thd2~0_In-1820800764)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1820800764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1820800764, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1820800764, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1820800764|, ~weak$$choice2~0=~weak$$choice2~0_In-1820800764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1820800764} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1820800764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1820800764, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1820800764, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1820800764|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1820800764|, ~weak$$choice2~0=~weak$$choice2~0_In-1820800764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1820800764} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:49:27,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 16:49:27,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-558403488 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-558403488 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-558403488|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-558403488 |P2Thread1of1ForFork2_#t~ite28_Out-558403488|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-558403488, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-558403488} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-558403488, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-558403488, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-558403488|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 16:49:27,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1888133092 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1888133092 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1888133092 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1888133092 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1888133092|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1888133092 |P2Thread1of1ForFork2_#t~ite29_Out1888133092|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888133092, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888133092, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888133092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888133092} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888133092, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888133092, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888133092, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1888133092|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888133092} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 16:49:27,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-587741251 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-587741251 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-587741251 ~y$r_buff0_thd3~0_In-587741251) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-587741251 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-587741251, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-587741251} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-587741251, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-587741251|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-587741251} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:49:27,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1831782422 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1831782422 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1831782422 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1831782422 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1831782422|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite31_Out1831782422| ~y$r_buff1_thd3~0_In1831782422)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1831782422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1831782422, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1831782422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1831782422} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1831782422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1831782422, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1831782422|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1831782422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1831782422} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:49:27,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~y$r_buff1_thd3~0_47) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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 16:49:27,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:49:27,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1403318849 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1403318849 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-1403318849| ~y$w_buff1~0_In-1403318849) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-1403318849| ~y~0_In-1403318849)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1403318849, ~y~0=~y~0_In-1403318849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1403318849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403318849} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1403318849, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1403318849|, ~y~0=~y~0_In-1403318849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1403318849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403318849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 16:49:27,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 16:49:27,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In662536514 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In662536514 256) 0))) (or (and (= ~y$w_buff0_used~0_In662536514 |ULTIMATE.start_main_#t~ite37_Out662536514|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out662536514|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In662536514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In662536514} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In662536514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In662536514, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out662536514|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:49:27,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1214195795 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1214195795 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1214195795 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1214195795 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out1214195795| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1214195795 |ULTIMATE.start_main_#t~ite38_Out1214195795|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1214195795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1214195795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1214195795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1214195795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1214195795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1214195795, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1214195795|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1214195795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1214195795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:49:27,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1049429495 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1049429495 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1049429495| ~y$r_buff0_thd0~0_In-1049429495)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1049429495| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1049429495, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1049429495} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1049429495, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1049429495|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1049429495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:49:27,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1466377053 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1466377053 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1466377053 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1466377053 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1466377053| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1466377053| ~y$r_buff1_thd0~0_In1466377053) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1466377053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1466377053, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1466377053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1466377053} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1466377053|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1466377053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1466377053, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1466377053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1466377053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:49:27,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_84 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= 1 v_~__unbuffered_p2_EAX~0_84) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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 16:49:28,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:49:28 BasicIcfg [2019-12-27 16:49:28,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:49:28,059 INFO L168 Benchmark]: Toolchain (without parser) took 14312.74 ms. Allocated memory was 144.7 MB in the beginning and 570.9 MB in the end (delta: 426.2 MB). Free memory was 101.1 MB in the beginning and 373.2 MB in the end (delta: -272.1 MB). Peak memory consumption was 154.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,060 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.89 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.76 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,062 INFO L168 Benchmark]: Boogie Preprocessor took 36.06 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,063 INFO L168 Benchmark]: RCFGBuilder took 770.97 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 107.9 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,064 INFO L168 Benchmark]: TraceAbstraction took 12584.17 ms. Allocated memory was 202.4 MB in the beginning and 570.9 MB in the end (delta: 368.6 MB). Free memory was 107.2 MB in the beginning and 373.2 MB in the end (delta: -266.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:28,068 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.89 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.76 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.06 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.97 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 107.9 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12584.17 ms. Allocated memory was 202.4 MB in the beginning and 570.9 MB in the end (delta: 368.6 MB). Free memory was 107.2 MB in the beginning and 373.2 MB in the end (delta: -266.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L824] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L826] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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 = !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) [L799] 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 [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L759] 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)) [L760] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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] [L760] 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)) [L761] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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] [L761] 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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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] [L799] 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) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L832] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 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, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 938 SDtfs, 1140 SDslu, 1207 SDs, 0 SdLazy, 604 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12302occurred 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.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1470 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 37271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...