/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:01:48,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:01:48,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:01:48,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:01:48,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:01:48,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:01:48,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:01:48,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:01:48,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:01:48,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:01:48,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:01:48,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:01:48,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:01:48,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:01:48,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:01:48,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:01:48,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:01:48,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:01:48,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:01:48,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:01:48,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:01:48,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:01:48,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:01:48,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:01:48,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:01:48,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:01:48,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:01:48,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:01:48,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:01:48,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:01:48,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:01:48,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:01:48,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:01:48,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:01:48,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:01:48,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:01:48,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:01:48,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:01:48,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:01:48,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:01:48,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:01:48,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:01:48,549 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:01:48,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:01:48,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:01:48,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:01:48,551 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:01:48,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:01:48,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:01:48,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:01:48,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:01:48,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:01:48,554 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:01:48,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:01:48,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:01:48,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:01:48,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:01:48,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:01:48,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:01:48,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:01:48,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:01:48,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:01:48,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:01:48,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:01:48,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:01:48,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:01:48,888 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:01:48,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.opt.i [2019-12-18 20:01:48,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7712457/e0bf8358e72a4c83a9497161b15aade3/FLAGd2c1f212a [2019-12-18 20:01:49,522 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:01:49,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.opt.i [2019-12-18 20:01:49,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7712457/e0bf8358e72a4c83a9497161b15aade3/FLAGd2c1f212a [2019-12-18 20:01:49,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7712457/e0bf8358e72a4c83a9497161b15aade3 [2019-12-18 20:01:49,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:01:49,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:01:49,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:01:49,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:01:49,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:01:49,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:01:49" (1/1) ... [2019-12-18 20:01:49,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:49, skipping insertion in model container [2019-12-18 20:01:49,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:01:49" (1/1) ... [2019-12-18 20:01:49,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:01:49,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:01:50,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:01:50,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:01:50,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:01:50,576 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:01:50,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50 WrapperNode [2019-12-18 20:01:50,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:01:50,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:01:50,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:01:50,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:01:50,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:01:50,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:01:50,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:01:50,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:01:50,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (1/1) ... [2019-12-18 20:01:50,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:01:50,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:01:50,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:01:50,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:01:50,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (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-18 20:01:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:01:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:01:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:01:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:01:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:01:50,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:01:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:01:50,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:01:50,776 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:01:50,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:01:50,777 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:01:50,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:01:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:01:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:01:50,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:01:50,780 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:01:51,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:01:51,646 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:01:51,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:01:51 BoogieIcfgContainer [2019-12-18 20:01:51,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:01:51,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:01:51,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:01:51,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:01:51,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:01:49" (1/3) ... [2019-12-18 20:01:51,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c39af56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:01:51, skipping insertion in model container [2019-12-18 20:01:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:01:50" (2/3) ... [2019-12-18 20:01:51,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c39af56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:01:51, skipping insertion in model container [2019-12-18 20:01:51,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:01:51" (3/3) ... [2019-12-18 20:01:51,655 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_power.opt.i [2019-12-18 20:01:51,664 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:01:51,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:01:51,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:01:51,673 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:01:51,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,747 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,747 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,747 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,747 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,748 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,774 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,774 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,780 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,785 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,786 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,788 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:01:51,808 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:01:51,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:01:51,828 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:01:51,828 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:01:51,828 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:01:51,829 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:01:51,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:01:51,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:01:51,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:01:51,846 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-18 20:01:51,848 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 20:01:51,959 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 20:01:51,959 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:01:51,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 20:01:52,025 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 20:01:52,121 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 20:01:52,121 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:01:52,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 20:01:52,174 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 20:01:52,175 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:01:55,553 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-18 20:01:55,937 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:01:56,069 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:01:56,393 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 20:01:56,569 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 20:01:56,599 INFO L206 etLargeBlockEncoding]: Checked pairs total: 148368 [2019-12-18 20:01:56,599 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-18 20:01:56,602 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-18 20:02:07,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93038 states. [2019-12-18 20:02:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93038 states. [2019-12-18 20:02:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 20:02:07,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:02:07,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:02:07,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:02:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:02:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -219848509, now seen corresponding path program 1 times [2019-12-18 20:02:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:02:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249929278] [2019-12-18 20:02:07,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:02:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:02:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:02:07,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249929278] [2019-12-18 20:02:07,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:02:07,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:02:07,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311406912] [2019-12-18 20:02:07,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:02:07,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:02:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:02:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:02:07,432 INFO L87 Difference]: Start difference. First operand 93038 states. Second operand 3 states. [2019-12-18 20:02:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:02:10,749 INFO L93 Difference]: Finished difference Result 92046 states and 422416 transitions. [2019-12-18 20:02:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:02:10,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 20:02:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:02:11,323 INFO L225 Difference]: With dead ends: 92046 [2019-12-18 20:02:11,323 INFO L226 Difference]: Without dead ends: 85710 [2019-12-18 20:02:11,325 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-18 20:02:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85710 states. [2019-12-18 20:02:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85710 to 85710. [2019-12-18 20:02:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85710 states. [2019-12-18 20:02:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85710 states to 85710 states and 393088 transitions. [2019-12-18 20:02:18,377 INFO L78 Accepts]: Start accepts. Automaton has 85710 states and 393088 transitions. Word has length 9 [2019-12-18 20:02:18,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:02:18,378 INFO L462 AbstractCegarLoop]: Abstraction has 85710 states and 393088 transitions. [2019-12-18 20:02:18,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:02:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 85710 states and 393088 transitions. [2019-12-18 20:02:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:02:18,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:02:18,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:02:18,390 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:02:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:02:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1999056324, now seen corresponding path program 1 times [2019-12-18 20:02:18,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:02:18,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46578088] [2019-12-18 20:02:18,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:02:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:02:18,479 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-18 20:02:18,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46578088] [2019-12-18 20:02:18,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:02:18,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:02:18,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001229638] [2019-12-18 20:02:18,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:02:18,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:02:18,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:02:18,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:02:18,482 INFO L87 Difference]: Start difference. First operand 85710 states and 393088 transitions. Second operand 4 states. [2019-12-18 20:02:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:02:22,801 INFO L93 Difference]: Finished difference Result 135910 states and 601052 transitions. [2019-12-18 20:02:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:02:22,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:02:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:02:23,506 INFO L225 Difference]: With dead ends: 135910 [2019-12-18 20:02:23,507 INFO L226 Difference]: Without dead ends: 135838 [2019-12-18 20:02:23,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:02:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135838 states. [2019-12-18 20:02:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135838 to 132030. [2019-12-18 20:02:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132030 states. [2019-12-18 20:02:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132030 states to 132030 states and 587252 transitions. [2019-12-18 20:02:34,654 INFO L78 Accepts]: Start accepts. Automaton has 132030 states and 587252 transitions. Word has length 15 [2019-12-18 20:02:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:02:34,655 INFO L462 AbstractCegarLoop]: Abstraction has 132030 states and 587252 transitions. [2019-12-18 20:02:34,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:02:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 132030 states and 587252 transitions. [2019-12-18 20:02:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:02:34,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:02:34,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:02:34,667 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:02:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:02:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 960194978, now seen corresponding path program 1 times [2019-12-18 20:02:34,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:02:34,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848098219] [2019-12-18 20:02:34,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:02:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:02:34,796 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-18 20:02:34,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848098219] [2019-12-18 20:02:34,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:02:34,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:02:34,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388235837] [2019-12-18 20:02:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:02:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:02:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:02:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:02:34,802 INFO L87 Difference]: Start difference. First operand 132030 states and 587252 transitions. Second operand 4 states. [2019-12-18 20:02:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:02:37,175 INFO L93 Difference]: Finished difference Result 167330 states and 735532 transitions. [2019-12-18 20:02:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:02:37,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 20:02:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:02:43,581 INFO L225 Difference]: With dead ends: 167330 [2019-12-18 20:02:43,582 INFO L226 Difference]: Without dead ends: 167270 [2019-12-18 20:02:43,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:02:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167270 states. [2019-12-18 20:02:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167270 to 149078. [2019-12-18 20:02:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149078 states. [2019-12-18 20:02:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149078 states to 149078 states and 660916 transitions. [2019-12-18 20:02:49,381 INFO L78 Accepts]: Start accepts. Automaton has 149078 states and 660916 transitions. Word has length 18 [2019-12-18 20:02:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:02:49,382 INFO L462 AbstractCegarLoop]: Abstraction has 149078 states and 660916 transitions. [2019-12-18 20:02:49,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:02:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 149078 states and 660916 transitions. [2019-12-18 20:02:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 20:02:49,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:02:49,400 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] [2019-12-18 20:02:49,400 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:02:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:02:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1006978459, now seen corresponding path program 1 times [2019-12-18 20:02:49,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:02:49,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137302605] [2019-12-18 20:02:49,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:02:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:02:49,531 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-18 20:02:49,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137302605] [2019-12-18 20:02:49,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:02:49,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:02:49,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107105530] [2019-12-18 20:02:49,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:02:49,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:02:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:02:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:02:49,534 INFO L87 Difference]: Start difference. First operand 149078 states and 660916 transitions. Second operand 3 states. [2019-12-18 20:02:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:02:51,402 INFO L93 Difference]: Finished difference Result 145939 states and 643818 transitions. [2019-12-18 20:02:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:02:51,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 20:02:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:02:51,922 INFO L225 Difference]: With dead ends: 145939 [2019-12-18 20:02:51,922 INFO L226 Difference]: Without dead ends: 145939 [2019-12-18 20:02:51,922 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-18 20:02:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145939 states. [2019-12-18 20:03:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145939 to 145939. [2019-12-18 20:03:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145939 states. [2019-12-18 20:03:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145939 states to 145939 states and 643818 transitions. [2019-12-18 20:03:06,188 INFO L78 Accepts]: Start accepts. Automaton has 145939 states and 643818 transitions. Word has length 20 [2019-12-18 20:03:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:06,188 INFO L462 AbstractCegarLoop]: Abstraction has 145939 states and 643818 transitions. [2019-12-18 20:03:06,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:03:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 145939 states and 643818 transitions. [2019-12-18 20:03:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 20:03:06,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:06,207 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] [2019-12-18 20:03:06,207 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash -776205731, now seen corresponding path program 1 times [2019-12-18 20:03:06,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:06,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557590010] [2019-12-18 20:03:06,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:06,264 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-18 20:03:06,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557590010] [2019-12-18 20:03:06,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:06,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:03:06,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264976628] [2019-12-18 20:03:06,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:03:06,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:03:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:03:06,266 INFO L87 Difference]: Start difference. First operand 145939 states and 643818 transitions. Second operand 3 states. [2019-12-18 20:03:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:07,244 INFO L93 Difference]: Finished difference Result 180068 states and 754679 transitions. [2019-12-18 20:03:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:03:07,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 20:03:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:13,876 INFO L225 Difference]: With dead ends: 180068 [2019-12-18 20:03:13,877 INFO L226 Difference]: Without dead ends: 146514 [2019-12-18 20:03:13,877 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-18 20:03:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2019-12-18 20:03:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 143325. [2019-12-18 20:03:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143325 states. [2019-12-18 20:03:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143325 states to 143325 states and 597576 transitions. [2019-12-18 20:03:18,542 INFO L78 Accepts]: Start accepts. Automaton has 143325 states and 597576 transitions. Word has length 21 [2019-12-18 20:03:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:18,542 INFO L462 AbstractCegarLoop]: Abstraction has 143325 states and 597576 transitions. [2019-12-18 20:03:18,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:03:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 143325 states and 597576 transitions. [2019-12-18 20:03:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 20:03:18,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:18,556 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] [2019-12-18 20:03:18,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1300239832, now seen corresponding path program 1 times [2019-12-18 20:03:18,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:18,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560400243] [2019-12-18 20:03:18,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:18,652 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-18 20:03:18,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560400243] [2019-12-18 20:03:18,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:18,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:03:18,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098460822] [2019-12-18 20:03:18,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:03:18,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:18,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:03:18,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:03:18,654 INFO L87 Difference]: Start difference. First operand 143325 states and 597576 transitions. Second operand 3 states. [2019-12-18 20:03:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:20,414 INFO L93 Difference]: Finished difference Result 143151 states and 596933 transitions. [2019-12-18 20:03:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:03:20,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 20:03:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:20,846 INFO L225 Difference]: With dead ends: 143151 [2019-12-18 20:03:20,846 INFO L226 Difference]: Without dead ends: 143151 [2019-12-18 20:03:20,847 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-18 20:03:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143151 states. [2019-12-18 20:03:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143151 to 143151. [2019-12-18 20:03:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143151 states. [2019-12-18 20:03:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143151 states to 143151 states and 596933 transitions. [2019-12-18 20:03:31,587 INFO L78 Accepts]: Start accepts. Automaton has 143151 states and 596933 transitions. Word has length 21 [2019-12-18 20:03:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:31,588 INFO L462 AbstractCegarLoop]: Abstraction has 143151 states and 596933 transitions. [2019-12-18 20:03:31,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:03:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 143151 states and 596933 transitions. [2019-12-18 20:03:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:03:31,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:31,606 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] [2019-12-18 20:03:31,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash -338694234, now seen corresponding path program 1 times [2019-12-18 20:03:31,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298327104] [2019-12-18 20:03:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:31,688 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-18 20:03:31,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298327104] [2019-12-18 20:03:31,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:31,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:03:31,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824368578] [2019-12-18 20:03:31,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:03:31,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:03:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:03:31,691 INFO L87 Difference]: Start difference. First operand 143151 states and 596933 transitions. Second operand 4 states. [2019-12-18 20:03:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:32,707 INFO L93 Difference]: Finished difference Result 210250 states and 827736 transitions. [2019-12-18 20:03:32,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:03:32,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 20:03:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:32,928 INFO L225 Difference]: With dead ends: 210250 [2019-12-18 20:03:32,928 INFO L226 Difference]: Without dead ends: 79302 [2019-12-18 20:03:32,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:03:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79302 states. [2019-12-18 20:03:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79302 to 78186. [2019-12-18 20:03:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78186 states. [2019-12-18 20:03:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78186 states to 78186 states and 272476 transitions. [2019-12-18 20:03:41,007 INFO L78 Accepts]: Start accepts. Automaton has 78186 states and 272476 transitions. Word has length 22 [2019-12-18 20:03:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:41,008 INFO L462 AbstractCegarLoop]: Abstraction has 78186 states and 272476 transitions. [2019-12-18 20:03:41,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:03:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 78186 states and 272476 transitions. [2019-12-18 20:03:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:03:41,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:41,017 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] [2019-12-18 20:03:41,017 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1675693570, now seen corresponding path program 2 times [2019-12-18 20:03:41,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:41,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990758775] [2019-12-18 20:03:41,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:41,065 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-18 20:03:41,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990758775] [2019-12-18 20:03:41,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:41,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:03:41,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366966131] [2019-12-18 20:03:41,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:03:41,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:03:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:03:41,067 INFO L87 Difference]: Start difference. First operand 78186 states and 272476 transitions. Second operand 3 states. [2019-12-18 20:03:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:41,513 INFO L93 Difference]: Finished difference Result 73900 states and 255147 transitions. [2019-12-18 20:03:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:03:41,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 20:03:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:41,739 INFO L225 Difference]: With dead ends: 73900 [2019-12-18 20:03:41,739 INFO L226 Difference]: Without dead ends: 73684 [2019-12-18 20:03:41,740 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-18 20:03:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73684 states. [2019-12-18 20:03:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73684 to 73468. [2019-12-18 20:03:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73468 states. [2019-12-18 20:03:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73468 states to 73468 states and 253875 transitions. [2019-12-18 20:03:44,186 INFO L78 Accepts]: Start accepts. Automaton has 73468 states and 253875 transitions. Word has length 22 [2019-12-18 20:03:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:44,186 INFO L462 AbstractCegarLoop]: Abstraction has 73468 states and 253875 transitions. [2019-12-18 20:03:44,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:03:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 73468 states and 253875 transitions. [2019-12-18 20:03:44,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:03:44,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:44,199 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] [2019-12-18 20:03:44,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:44,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2098624475, now seen corresponding path program 1 times [2019-12-18 20:03:44,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:44,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181186557] [2019-12-18 20:03:44,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:44,275 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-18 20:03:44,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181186557] [2019-12-18 20:03:44,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:44,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:03:44,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489653094] [2019-12-18 20:03:44,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:03:44,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:03:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:03:44,277 INFO L87 Difference]: Start difference. First operand 73468 states and 253875 transitions. Second operand 5 states. [2019-12-18 20:03:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:45,260 INFO L93 Difference]: Finished difference Result 87478 states and 296814 transitions. [2019-12-18 20:03:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:03:45,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 20:03:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:46,172 INFO L225 Difference]: With dead ends: 87478 [2019-12-18 20:03:46,172 INFO L226 Difference]: Without dead ends: 85842 [2019-12-18 20:03:46,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:03:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85842 states. [2019-12-18 20:03:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85842 to 71222. [2019-12-18 20:03:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71222 states. [2019-12-18 20:03:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71222 states to 71222 states and 245537 transitions. [2019-12-18 20:03:48,492 INFO L78 Accepts]: Start accepts. Automaton has 71222 states and 245537 transitions. Word has length 24 [2019-12-18 20:03:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:48,492 INFO L462 AbstractCegarLoop]: Abstraction has 71222 states and 245537 transitions. [2019-12-18 20:03:48,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:03:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71222 states and 245537 transitions. [2019-12-18 20:03:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 20:03:48,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:48,557 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] [2019-12-18 20:03:48,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:48,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1881257346, now seen corresponding path program 1 times [2019-12-18 20:03:48,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:48,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741339598] [2019-12-18 20:03:48,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:48,638 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-18 20:03:48,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741339598] [2019-12-18 20:03:48,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:48,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:03:48,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541049866] [2019-12-18 20:03:48,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:03:48,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:48,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:03:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:03:48,641 INFO L87 Difference]: Start difference. First operand 71222 states and 245537 transitions. Second operand 3 states. [2019-12-18 20:03:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:48,900 INFO L93 Difference]: Finished difference Result 71222 states and 242269 transitions. [2019-12-18 20:03:48,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:03:48,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 20:03:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:49,028 INFO L225 Difference]: With dead ends: 71222 [2019-12-18 20:03:49,028 INFO L226 Difference]: Without dead ends: 71222 [2019-12-18 20:03:49,029 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-18 20:03:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2019-12-18 20:03:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 71046. [2019-12-18 20:03:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71046 states. [2019-12-18 20:03:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71046 states to 71046 states and 241801 transitions. [2019-12-18 20:03:51,094 INFO L78 Accepts]: Start accepts. Automaton has 71046 states and 241801 transitions. Word has length 36 [2019-12-18 20:03:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:51,094 INFO L462 AbstractCegarLoop]: Abstraction has 71046 states and 241801 transitions. [2019-12-18 20:03:51,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:03:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71046 states and 241801 transitions. [2019-12-18 20:03:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:03:51,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:51,152 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] [2019-12-18 20:03:51,153 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1678028845, now seen corresponding path program 1 times [2019-12-18 20:03:51,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:51,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979155866] [2019-12-18 20:03:51,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:51,268 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-18 20:03:51,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979155866] [2019-12-18 20:03:51,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:51,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:03:51,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856254517] [2019-12-18 20:03:51,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:03:51,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:03:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:03:51,270 INFO L87 Difference]: Start difference. First operand 71046 states and 241801 transitions. Second operand 9 states. [2019-12-18 20:03:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:03:53,500 INFO L93 Difference]: Finished difference Result 172806 states and 593056 transitions. [2019-12-18 20:03:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:03:53,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 20:03:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:03:53,814 INFO L225 Difference]: With dead ends: 172806 [2019-12-18 20:03:53,814 INFO L226 Difference]: Without dead ends: 144716 [2019-12-18 20:03:53,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:03:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144716 states. [2019-12-18 20:03:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144716 to 104724. [2019-12-18 20:03:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104724 states. [2019-12-18 20:03:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104724 states to 104724 states and 363296 transitions. [2019-12-18 20:03:58,223 INFO L78 Accepts]: Start accepts. Automaton has 104724 states and 363296 transitions. Word has length 37 [2019-12-18 20:03:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:03:58,224 INFO L462 AbstractCegarLoop]: Abstraction has 104724 states and 363296 transitions. [2019-12-18 20:03:58,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:03:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 104724 states and 363296 transitions. [2019-12-18 20:03:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:03:58,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:03:58,331 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] [2019-12-18 20:03:58,331 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:03:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:03:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1355430725, now seen corresponding path program 2 times [2019-12-18 20:03:58,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:03:58,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563711381] [2019-12-18 20:03:58,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:03:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:03:58,502 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-18 20:03:58,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563711381] [2019-12-18 20:03:58,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:03:58,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:03:58,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870489122] [2019-12-18 20:03:58,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:03:58,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:03:58,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:03:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:03:58,504 INFO L87 Difference]: Start difference. First operand 104724 states and 363296 transitions. Second operand 10 states. [2019-12-18 20:04:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:00,843 INFO L93 Difference]: Finished difference Result 146698 states and 515074 transitions. [2019-12-18 20:04:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:04:00,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 20:04:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:01,154 INFO L225 Difference]: With dead ends: 146698 [2019-12-18 20:04:01,154 INFO L226 Difference]: Without dead ends: 137050 [2019-12-18 20:04:01,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:04:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137050 states. [2019-12-18 20:04:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137050 to 108540. [2019-12-18 20:04:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108540 states. [2019-12-18 20:04:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108540 states to 108540 states and 377388 transitions. [2019-12-18 20:04:05,241 INFO L78 Accepts]: Start accepts. Automaton has 108540 states and 377388 transitions. Word has length 37 [2019-12-18 20:04:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:05,241 INFO L462 AbstractCegarLoop]: Abstraction has 108540 states and 377388 transitions. [2019-12-18 20:04:05,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:04:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 108540 states and 377388 transitions. [2019-12-18 20:04:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:04:05,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:05,340 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] [2019-12-18 20:04:05,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash -830829175, now seen corresponding path program 3 times [2019-12-18 20:04:05,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:05,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603462003] [2019-12-18 20:04:05,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:05,499 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-18 20:04:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603462003] [2019-12-18 20:04:05,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:05,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:04:05,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159224084] [2019-12-18 20:04:05,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:04:05,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:04:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:04:05,502 INFO L87 Difference]: Start difference. First operand 108540 states and 377388 transitions. Second operand 11 states. [2019-12-18 20:04:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:07,905 INFO L93 Difference]: Finished difference Result 197678 states and 691020 transitions. [2019-12-18 20:04:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:04:07,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-12-18 20:04:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:08,313 INFO L225 Difference]: With dead ends: 197678 [2019-12-18 20:04:08,313 INFO L226 Difference]: Without dead ends: 186830 [2019-12-18 20:04:08,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:04:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186830 states. [2019-12-18 20:04:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186830 to 109434. [2019-12-18 20:04:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109434 states. [2019-12-18 20:04:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109434 states to 109434 states and 380664 transitions. [2019-12-18 20:04:17,065 INFO L78 Accepts]: Start accepts. Automaton has 109434 states and 380664 transitions. Word has length 37 [2019-12-18 20:04:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:17,065 INFO L462 AbstractCegarLoop]: Abstraction has 109434 states and 380664 transitions. [2019-12-18 20:04:17,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:04:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 109434 states and 380664 transitions. [2019-12-18 20:04:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:04:17,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:17,179 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] [2019-12-18 20:04:17,179 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1364615503, now seen corresponding path program 4 times [2019-12-18 20:04:17,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:17,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651473588] [2019-12-18 20:04:17,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:17,287 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-18 20:04:17,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651473588] [2019-12-18 20:04:17,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:17,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:04:17,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538365718] [2019-12-18 20:04:17,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:04:17,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:04:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:04:17,289 INFO L87 Difference]: Start difference. First operand 109434 states and 380664 transitions. Second operand 7 states. [2019-12-18 20:04:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:19,535 INFO L93 Difference]: Finished difference Result 221052 states and 760992 transitions. [2019-12-18 20:04:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:04:19,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-18 20:04:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:20,002 INFO L225 Difference]: With dead ends: 221052 [2019-12-18 20:04:20,003 INFO L226 Difference]: Without dead ends: 197728 [2019-12-18 20:04:20,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:04:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197728 states. [2019-12-18 20:04:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197728 to 121040. [2019-12-18 20:04:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121040 states. [2019-12-18 20:04:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121040 states to 121040 states and 418838 transitions. [2019-12-18 20:04:28,212 INFO L78 Accepts]: Start accepts. Automaton has 121040 states and 418838 transitions. Word has length 37 [2019-12-18 20:04:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:28,213 INFO L462 AbstractCegarLoop]: Abstraction has 121040 states and 418838 transitions. [2019-12-18 20:04:28,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:04:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 121040 states and 418838 transitions. [2019-12-18 20:04:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 20:04:29,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:29,092 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] [2019-12-18 20:04:29,093 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -335825104, now seen corresponding path program 1 times [2019-12-18 20:04:29,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:29,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395327534] [2019-12-18 20:04:29,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:29,169 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-18 20:04:29,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395327534] [2019-12-18 20:04:29,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:29,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:04:29,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954638222] [2019-12-18 20:04:29,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:04:29,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:04:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:04:29,171 INFO L87 Difference]: Start difference. First operand 121040 states and 418838 transitions. Second operand 5 states. [2019-12-18 20:04:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:29,654 INFO L93 Difference]: Finished difference Result 72035 states and 240794 transitions. [2019-12-18 20:04:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:04:29,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-18 20:04:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:29,831 INFO L225 Difference]: With dead ends: 72035 [2019-12-18 20:04:29,831 INFO L226 Difference]: Without dead ends: 64559 [2019-12-18 20:04:29,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:04:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64559 states. [2019-12-18 20:04:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64559 to 64004. [2019-12-18 20:04:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64004 states. [2019-12-18 20:04:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64004 states to 64004 states and 216143 transitions. [2019-12-18 20:04:32,559 INFO L78 Accepts]: Start accepts. Automaton has 64004 states and 216143 transitions. Word has length 38 [2019-12-18 20:04:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:32,559 INFO L462 AbstractCegarLoop]: Abstraction has 64004 states and 216143 transitions. [2019-12-18 20:04:32,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:04:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64004 states and 216143 transitions. [2019-12-18 20:04:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:04:32,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:32,613 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] [2019-12-18 20:04:32,613 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1018558760, now seen corresponding path program 1 times [2019-12-18 20:04:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:32,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079023728] [2019-12-18 20:04:32,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:32,716 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-18 20:04:32,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079023728] [2019-12-18 20:04:32,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:32,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:04:32,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102695870] [2019-12-18 20:04:32,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:04:32,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:04:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:04:32,718 INFO L87 Difference]: Start difference. First operand 64004 states and 216143 transitions. Second operand 6 states. [2019-12-18 20:04:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:32,878 INFO L93 Difference]: Finished difference Result 12383 states and 35136 transitions. [2019-12-18 20:04:32,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:04:32,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 20:04:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:32,899 INFO L225 Difference]: With dead ends: 12383 [2019-12-18 20:04:32,899 INFO L226 Difference]: Without dead ends: 8540 [2019-12-18 20:04:32,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:04:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2019-12-18 20:04:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 7973. [2019-12-18 20:04:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-12-18 20:04:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 20163 transitions. [2019-12-18 20:04:33,094 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 20163 transitions. Word has length 39 [2019-12-18 20:04:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:33,094 INFO L462 AbstractCegarLoop]: Abstraction has 7973 states and 20163 transitions. [2019-12-18 20:04:33,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:04:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 20163 transitions. [2019-12-18 20:04:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 20:04:33,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:33,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:04:33,109 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1807974181, now seen corresponding path program 1 times [2019-12-18 20:04:33,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:33,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785489595] [2019-12-18 20:04:33,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:33,200 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-18 20:04:33,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785489595] [2019-12-18 20:04:33,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:33,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:04:33,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703602588] [2019-12-18 20:04:33,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:04:33,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:04:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:04:33,204 INFO L87 Difference]: Start difference. First operand 7973 states and 20163 transitions. Second operand 4 states. [2019-12-18 20:04:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:33,265 INFO L93 Difference]: Finished difference Result 8935 states and 22358 transitions. [2019-12-18 20:04:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:04:33,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 20:04:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:33,281 INFO L225 Difference]: With dead ends: 8935 [2019-12-18 20:04:33,281 INFO L226 Difference]: Without dead ends: 7695 [2019-12-18 20:04:33,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:04:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7695 states. [2019-12-18 20:04:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7695 to 7677. [2019-12-18 20:04:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7677 states. [2019-12-18 20:04:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7677 states to 7677 states and 19430 transitions. [2019-12-18 20:04:33,467 INFO L78 Accepts]: Start accepts. Automaton has 7677 states and 19430 transitions. Word has length 50 [2019-12-18 20:04:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:33,467 INFO L462 AbstractCegarLoop]: Abstraction has 7677 states and 19430 transitions. [2019-12-18 20:04:33,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:04:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7677 states and 19430 transitions. [2019-12-18 20:04:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 20:04:33,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:33,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:04:33,480 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1074177589, now seen corresponding path program 2 times [2019-12-18 20:04:33,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:33,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993602099] [2019-12-18 20:04:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:04:33,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993602099] [2019-12-18 20:04:33,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:33,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:04:33,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845819966] [2019-12-18 20:04:33,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:04:33,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:33,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:04:33,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:04:33,635 INFO L87 Difference]: Start difference. First operand 7677 states and 19430 transitions. Second operand 7 states. [2019-12-18 20:04:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:33,753 INFO L93 Difference]: Finished difference Result 6471 states and 16654 transitions. [2019-12-18 20:04:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:04:33,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 20:04:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:33,755 INFO L225 Difference]: With dead ends: 6471 [2019-12-18 20:04:33,755 INFO L226 Difference]: Without dead ends: 508 [2019-12-18 20:04:33,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:04:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-18 20:04:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-12-18 20:04:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-18 20:04:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1119 transitions. [2019-12-18 20:04:33,763 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1119 transitions. Word has length 50 [2019-12-18 20:04:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:33,763 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1119 transitions. [2019-12-18 20:04:33,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:04:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1119 transitions. [2019-12-18 20:04:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:04:33,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:33,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:04:33,765 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:33,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1499988210, now seen corresponding path program 1 times [2019-12-18 20:04:33,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:33,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331363097] [2019-12-18 20:04:33,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:04:33,862 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-18 20:04:33,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331363097] [2019-12-18 20:04:33,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:04:33,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:04:33,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552142097] [2019-12-18 20:04:33,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:04:33,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:04:33,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:04:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:04:33,864 INFO L87 Difference]: Start difference. First operand 508 states and 1119 transitions. Second operand 8 states. [2019-12-18 20:04:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:04:34,073 INFO L93 Difference]: Finished difference Result 1039 states and 2246 transitions. [2019-12-18 20:04:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:04:34,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:04:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:04:34,075 INFO L225 Difference]: With dead ends: 1039 [2019-12-18 20:04:34,075 INFO L226 Difference]: Without dead ends: 764 [2019-12-18 20:04:34,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:04:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-18 20:04:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2019-12-18 20:04:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-18 20:04:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1300 transitions. [2019-12-18 20:04:34,083 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1300 transitions. Word has length 66 [2019-12-18 20:04:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:04:34,083 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1300 transitions. [2019-12-18 20:04:34,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:04:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1300 transitions. [2019-12-18 20:04:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:04:34,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:04:34,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:04:34,084 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:04:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:04:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 719111176, now seen corresponding path program 2 times [2019-12-18 20:04:34,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:04:34,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020780748] [2019-12-18 20:04:34,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:04:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:04:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:04:34,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:04:34,235 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:04:34,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$w_buff1~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t125~0.base_29|) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 |v_ULTIMATE.start_main_~#t125~0.offset_21|) (= v_~a~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t125~0.base_29| 1) |v_#valid_72|) (= v_~z$w_buff0_used~0_132 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd4~0_77 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$r_buff0_thd3~0_54 0) (= 0 v_~z$r_buff1_thd4~0_38) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (= 0 v_~weak$$choice2~0_36) (= v_~x~0_17 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_#NULL.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t125~0.base_29|)) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~weak$$choice0~0_11) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$read_delayed_var~0.base_7 0) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t125~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t125~0.base_29|) |v_ULTIMATE.start_main_~#t125~0.offset_21| 0)) |v_#memory_int_31|) (= 0 v_~z$r_buff1_thd3~0_27) (= v_~main$tmp_guard1~0_14 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t125~0.base_29| 4) |v_#length_31|) (= 0 v_~__unbuffered_p3_EBX~0_14) (= |v_#NULL.offset_4| 0) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p3_EAX~0_13) (= v_~y~0_11 0) (= 0 v_~z$w_buff0~0_39) (= v_~main$tmp_guard0~0_11 0) (= v_~z~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t126~0.base=|v_ULTIMATE.start_main_~#t126~0.base_21|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_19|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_~#t127~0.offset=|v_ULTIMATE.start_main_~#t127~0.offset_17|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ULTIMATE.start_main_~#t125~0.base=|v_ULTIMATE.start_main_~#t125~0.base_29|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t126~0.offset=|v_ULTIMATE.start_main_~#t126~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_38, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_34, ULTIMATE.start_main_~#t125~0.offset=|v_ULTIMATE.start_main_~#t125~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ULTIMATE.start_main_~#t128~0.offset=|v_ULTIMATE.start_main_~#t128~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ULTIMATE.start_main_~#t128~0.base=|v_ULTIMATE.start_main_~#t128~0.base_21|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_~#t127~0.base=|v_ULTIMATE.start_main_~#t127~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t126~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t127~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t125~0.base, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t126~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t125~0.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t128~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t128~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t127~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:04:34,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L856-1-->L858: Formula: (and (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t126~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t126~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t126~0.base_11|) |v_ULTIMATE.start_main_~#t126~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t126~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t126~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t126~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t126~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t126~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t126~0.base=|v_ULTIMATE.start_main_~#t126~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t126~0.offset=|v_ULTIMATE.start_main_~#t126~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t126~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t126~0.offset, #length] because there is no mapped edge [2019-12-18 20:04:34,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t127~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t127~0.base_12| 0)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t127~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t127~0.base_12|) |v_ULTIMATE.start_main_~#t127~0.offset_11| 2)) |v_#memory_int_21|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t127~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t127~0.base_12| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t127~0.base_12|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t127~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t127~0.base=|v_ULTIMATE.start_main_~#t127~0.base_12|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t127~0.offset=|v_ULTIMATE.start_main_~#t127~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t127~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t127~0.offset] because there is no mapped edge [2019-12-18 20:04:34,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t128~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t128~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t128~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t128~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t128~0.base_13|) |v_ULTIMATE.start_main_~#t128~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t128~0.base_13|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t128~0.base_13|)) (= |v_ULTIMATE.start_main_~#t128~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t128~0.base=|v_ULTIMATE.start_main_~#t128~0.base_13|, ULTIMATE.start_main_~#t128~0.offset=|v_ULTIMATE.start_main_~#t128~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t128~0.base, ULTIMATE.start_main_~#t128~0.offset] because there is no mapped edge [2019-12-18 20:04:34,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_18) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0_used~0_91 1) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_92 v_~z$w_buff1_used~0_51) (= 0 (mod v_~z$w_buff1_used~0_51 256)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_51, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 20:04:34,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1626662865 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1626662865 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out1626662865| |P3Thread1of1ForFork2_#t~ite29_Out1626662865|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1626662865| ~z$w_buff1~0_In1626662865) (or .cse0 .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1626662865| ~z$w_buff0~0_In1626662865) (not .cse1) (not .cse0) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1626662865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1626662865, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1626662865, ~z$w_buff1~0=~z$w_buff1~0_In1626662865} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1626662865|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1626662865|, ~z$w_buff0~0=~z$w_buff0~0_In1626662865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1626662865, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1626662865, ~z$w_buff1~0=~z$w_buff1~0_In1626662865} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 20:04:34,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~z$r_buff0_thd4~0_51 v_~z$r_buff0_thd4~0_50)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 20:04:34,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In117421565 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In117421565 |P3Thread1of1ForFork2_#t~ite48_Out117421565|)) (and .cse0 (= ~z~0_In117421565 |P3Thread1of1ForFork2_#t~ite48_Out117421565|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In117421565, ~z$flush_delayed~0=~z$flush_delayed~0_In117421565, ~z~0=~z~0_In117421565} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In117421565, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out117421565|, ~z$flush_delayed~0=~z$flush_delayed~0_In117421565, ~z~0=~z~0_In117421565} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 20:04:34,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~a~0_6) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 1 v_~x~0_8)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 20:04:34,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_5)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_5, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 20:04:34,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1416045680 256) 0))) (or (and (= ~z$mem_tmp~0_In1416045680 |P2Thread1of1ForFork1_#t~ite25_Out1416045680|) (not .cse0)) (and (= ~z~0_In1416045680 |P2Thread1of1ForFork1_#t~ite25_Out1416045680|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1416045680, ~z$flush_delayed~0=~z$flush_delayed~0_In1416045680, ~z~0=~z~0_In1416045680} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1416045680, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1416045680|, ~z$flush_delayed~0=~z$flush_delayed~0_In1416045680, ~z~0=~z~0_In1416045680} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 20:04:34,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2142660033 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-2142660033 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2142660033| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-2142660033| ~z$w_buff0_used~0_In-2142660033)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142660033, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2142660033} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2142660033|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142660033, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2142660033} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 20:04:34,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-664830359 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-664830359 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-664830359 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-664830359 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-664830359|)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-664830359| ~z$w_buff1_used~0_In-664830359) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664830359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664830359, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664830359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664830359} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-664830359|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-664830359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664830359, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664830359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-664830359} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 20:04:34,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2117539983 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2117539983 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-2117539983)) (and (= ~z$r_buff0_thd4~0_Out-2117539983 ~z$r_buff0_thd4~0_In-2117539983) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117539983, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2117539983} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-2117539983|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117539983, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2117539983} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 20:04:34,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-870828236 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-870828236 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-870828236 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-870828236 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-870828236|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd4~0_In-870828236 |P3Thread1of1ForFork2_#t~ite54_Out-870828236|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-870828236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870828236, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-870828236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-870828236} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-870828236|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-870828236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870828236, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-870828236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-870828236} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 20:04:34,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_8| v_~z$r_buff1_thd4~0_32) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_7|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_32, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:04:34,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~z~0_23 |v_P2Thread1of1ForFork1_#t~ite25_8|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:04:34,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$r_buff0_thd0~0_14 256)) (= 0 (mod v_~z$w_buff0_used~0_93 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:04:34,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1874291940 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite60_Out1874291940| |ULTIMATE.start_main_#t~ite59_Out1874291940|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1874291940 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1874291940| ~z~0_In1874291940) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In1874291940 |ULTIMATE.start_main_#t~ite59_Out1874291940|) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1874291940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874291940, ~z$w_buff1~0=~z$w_buff1~0_In1874291940, ~z~0=~z~0_In1874291940} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1874291940|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1874291940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874291940, ~z$w_buff1~0=~z$w_buff1~0_In1874291940, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1874291940|, ~z~0=~z~0_In1874291940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:04:34,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In727436042 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In727436042 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out727436042| ~z$w_buff0_used~0_In727436042) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out727436042|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727436042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727436042} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727436042, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out727436042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727436042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:04:34,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1690229948 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1690229948 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1690229948 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1690229948 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out1690229948| ~z$w_buff1_used~0_In1690229948)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1690229948|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1690229948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1690229948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1690229948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1690229948} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1690229948|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1690229948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1690229948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1690229948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1690229948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:04:34,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1610406602 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1610406602 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1610406602|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1610406602 |ULTIMATE.start_main_#t~ite63_Out1610406602|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1610406602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1610406602} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1610406602|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1610406602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1610406602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:04:34,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1050868915 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1050868915 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1050868915 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1050868915 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out1050868915| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite64_Out1050868915| ~z$r_buff1_thd0~0_In1050868915)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050868915, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050868915, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1050868915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1050868915} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050868915, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050868915, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1050868915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1050868915, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1050868915|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 20:04:34,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1044] [1044] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_7) (= |v_ULTIMATE.start_main_#t~ite64_11| v_~z$r_buff1_thd0~0_15) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:04:34,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:04:34 BasicIcfg [2019-12-18 20:04:34,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:04:34,453 INFO L168 Benchmark]: Toolchain (without parser) took 164633.97 ms. Allocated memory was 139.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,453 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.47 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.75 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,456 INFO L168 Benchmark]: Boogie Preprocessor took 41.00 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,457 INFO L168 Benchmark]: RCFGBuilder took 956.02 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.7 MB in the beginning and 206.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,457 INFO L168 Benchmark]: TraceAbstraction took 162800.42 ms. Allocated memory was 235.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 206.5 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:04:34,467 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.62 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.47 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.75 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.00 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 956.02 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.7 MB in the beginning and 206.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162800.42 ms. Allocated memory was 235.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 206.5 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 212 ProgramPointsBefore, 115 ProgramPointsAfterwards, 255 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 47 ConcurrentYvCompositions, 28 ChoiceCompositions, 10757 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 148368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 162.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 46.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4772 SDtfs, 7334 SDslu, 12265 SDs, 0 SdLazy, 4952 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149078occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 97.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 265199 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 74132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...