/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:43:09,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:43:09,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:43:09,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:43:09,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:43:09,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:43:09,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:43:09,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:43:09,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:43:09,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:43:09,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:43:09,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:43:09,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:43:09,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:43:09,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:43:09,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:43:09,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:43:09,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:43:09,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:43:09,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:43:09,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:43:09,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:43:09,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:43:09,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:43:09,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:43:09,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:43:09,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:43:09,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:43:09,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:43:09,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:43:09,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:43:09,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:43:09,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:43:09,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:43:09,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:43:09,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:43:09,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:43:09,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:43:09,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:43:09,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:43:09,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:43:09,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:43:09,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:43:09,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:43:09,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:43:09,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:43:09,219 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:43:09,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:43:09,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:43:09,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:43:09,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:43:09,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:43:09,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:43:09,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:43:09,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:43:09,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:43:09,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:43:09,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:43:09,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:43:09,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:43:09,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:43:09,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:43:09,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:43:09,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:43:09,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:43:09,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:43:09,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:43:09,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:43:09,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:43:09,224 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:43:09,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:43:09,225 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:43:09,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:43:09,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:43:09,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:43:09,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:43:09,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:43:09,539 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:43:09,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-27 16:43:09,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85c50db/885fbb18edb941f0be263de8aedbbf5b/FLAG7cf3e596a [2019-12-27 16:43:10,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:43:10,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-27 16:43:10,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85c50db/885fbb18edb941f0be263de8aedbbf5b/FLAG7cf3e596a [2019-12-27 16:43:10,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85c50db/885fbb18edb941f0be263de8aedbbf5b [2019-12-27 16:43:10,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:43:10,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:43:10,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:43:10,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:43:10,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:43:10,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:43:10" (1/1) ... [2019-12-27 16:43:10,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:10, skipping insertion in model container [2019-12-27 16:43:10,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:43:10" (1/1) ... [2019-12-27 16:43:10,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:43:10,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:43:11,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:43:11,141 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:43:11,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:43:11,329 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:43:11,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11 WrapperNode [2019-12-27 16:43:11,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:43:11,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:43:11,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:43:11,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:43:11,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:43:11,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:43:11,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:43:11,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:43:11,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... [2019-12-27 16:43:11,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:43:11,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:43:11,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:43:11,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:43:11,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:43:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:43:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:43:11,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:43:11,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:43:11,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:43:11,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:43:11,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:43:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:43:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:43:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:43:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:43:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:43:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:43:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:43:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:43:11,553 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:43:12,503 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:43:12,503 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:43:12,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:43:12 BoogieIcfgContainer [2019-12-27 16:43:12,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:43:12,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:43:12,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:43:12,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:43:12,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:43:10" (1/3) ... [2019-12-27 16:43:12,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78293217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:43:12, skipping insertion in model container [2019-12-27 16:43:12,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:11" (2/3) ... [2019-12-27 16:43:12,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78293217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:43:12, skipping insertion in model container [2019-12-27 16:43:12,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:43:12" (3/3) ... [2019-12-27 16:43:12,514 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.opt.i [2019-12-27 16:43:12,524 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:43:12,524 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:43:12,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:43:12,535 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:43:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,586 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,586 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,595 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,595 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,595 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,595 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,616 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,623 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:43:12,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:43:12,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:43:12,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:43:12,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:43:12,663 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:43:12,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:43:12,663 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:43:12,663 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:43:12,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:43:12,683 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-27 16:43:12,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 16:43:12,818 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 16:43:12,819 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:43:12,842 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 16:43:12,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 16:43:12,955 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 16:43:12,955 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:43:12,969 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 16:43:13,006 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-27 16:43:13,008 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:43:16,199 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-27 16:43:19,358 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:43:19,499 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:43:19,619 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-27 16:43:19,619 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-27 16:43:19,623 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-27 16:43:31,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-27 16:43:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-27 16:43:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:43:31,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:31,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:31,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-27 16:43:31,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:31,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903654518] [2019-12-27 16:43:31,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903654518] [2019-12-27 16:43:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:31,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:43:31,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949721956] [2019-12-27 16:43:31,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:31,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:32,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:43:32,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:32,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:32,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:43:32,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:43:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:43:32,141 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-27 16:43:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:33,646 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-27 16:43:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:43:33,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:43:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:37,450 INFO L225 Difference]: With dead ends: 105018 [2019-12-27 16:43:37,451 INFO L226 Difference]: Without dead ends: 102886 [2019-12-27 16:43:37,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:43:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-27 16:43:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-27 16:43:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-27 16:43:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-27 16:43:47,007 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-27 16:43:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:47,008 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-27 16:43:47,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:43:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-27 16:43:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:43:47,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:47,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:47,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-27 16:43:47,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:47,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478657357] [2019-12-27 16:43:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:47,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478657357] [2019-12-27 16:43:47,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:47,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:43:47,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499733162] [2019-12-27 16:43:47,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:47,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:47,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 16:43:47,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:47,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:47,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:43:47,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:43:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:43:47,152 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-27 16:43:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:52,848 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-27 16:43:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:43:52,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:43:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:53,558 INFO L225 Difference]: With dead ends: 165574 [2019-12-27 16:43:53,559 INFO L226 Difference]: Without dead ends: 165546 [2019-12-27 16:43:53,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:43:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-27 16:43:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-27 16:43:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-27 16:44:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-27 16:44:06,501 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-27 16:44:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:06,502 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-27 16:44:06,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-27 16:44:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:44:06,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:06,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:06,505 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-27 16:44:06,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:06,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846399862] [2019-12-27 16:44:06,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:06,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846399862] [2019-12-27 16:44:06,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:06,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:06,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194711685] [2019-12-27 16:44:06,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:06,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:06,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:44:06,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:06,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:06,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:06,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:06,565 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-27 16:44:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:07,212 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-27 16:44:07,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:07,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:44:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:07,710 INFO L225 Difference]: With dead ends: 124009 [2019-12-27 16:44:07,711 INFO L226 Difference]: Without dead ends: 124009 [2019-12-27 16:44:07,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-27 16:44:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-27 16:44:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-27 16:44:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-27 16:44:15,309 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-27 16:44:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-27 16:44:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-27 16:44:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:44:15,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:15,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:15,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-27 16:44:15,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:15,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143615887] [2019-12-27 16:44:15,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:15,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143615887] [2019-12-27 16:44:15,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:15,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:15,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261154960] [2019-12-27 16:44:15,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:15,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:15,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:44:15,383 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:15,383 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:15,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:15,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:15,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:15,384 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-27 16:44:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:15,671 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-27 16:44:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:44:15,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:44:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:15,784 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 16:44:15,785 INFO L226 Difference]: Without dead ends: 48600 [2019-12-27 16:44:15,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-27 16:44:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-27 16:44:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-27 16:44:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-27 16:44:21,365 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-27 16:44:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:21,365 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-27 16:44:21,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-27 16:44:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:44:21,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:21,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:21,368 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-27 16:44:21,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:21,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625980552] [2019-12-27 16:44:21,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:21,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625980552] [2019-12-27 16:44:21,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:21,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:44:21,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365960008] [2019-12-27 16:44:21,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:21,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:21,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 16:44:21,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:21,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:44:21,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:44:21,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:44:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:21,482 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 6 states. [2019-12-27 16:44:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:21,562 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-27 16:44:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:21,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 16:44:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:21,581 INFO L225 Difference]: With dead ends: 6591 [2019-12-27 16:44:21,581 INFO L226 Difference]: Without dead ends: 6591 [2019-12-27 16:44:21,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-27 16:44:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-27 16:44:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-27 16:44:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-27 16:44:21,682 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-27 16:44:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:21,682 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-27 16:44:21,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:44:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-27 16:44:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:44:21,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:21,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:21,689 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-27 16:44:21,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:21,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876063076] [2019-12-27 16:44:21,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:21,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876063076] [2019-12-27 16:44:21,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:21,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:21,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [362143783] [2019-12-27 16:44:21,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:21,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:21,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 181 transitions. [2019-12-27 16:44:21,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:21,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:21,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:44:21,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:21,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:44:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:21,830 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-27 16:44:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:21,890 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-27 16:44:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:21,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 16:44:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:21,900 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 16:44:21,900 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 16:44:21,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 16:44:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-27 16:44:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-27 16:44:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-27 16:44:21,947 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-27 16:44:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-27 16:44:21,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:44:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-27 16:44:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:21,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:21,956 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:21,957 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-27 16:44:21,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:21,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790625505] [2019-12-27 16:44:21,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:22,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790625505] [2019-12-27 16:44:22,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:22,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:44:22,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164028038] [2019-12-27 16:44:22,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:22,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:22,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 324 states and 647 transitions. [2019-12-27 16:44:22,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:22,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 16:44:22,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:44:22,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:44:22,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:44:22,561 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 11 states. [2019-12-27 16:44:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:24,898 INFO L93 Difference]: Finished difference Result 10676 states and 32986 transitions. [2019-12-27 16:44:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:44:24,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-27 16:44:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:24,918 INFO L225 Difference]: With dead ends: 10676 [2019-12-27 16:44:24,918 INFO L226 Difference]: Without dead ends: 10676 [2019-12-27 16:44:24,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:44:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-27 16:44:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 4901. [2019-12-27 16:44:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4901 states. [2019-12-27 16:44:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 15405 transitions. [2019-12-27 16:44:25,024 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 15405 transitions. Word has length 74 [2019-12-27 16:44:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:25,025 INFO L462 AbstractCegarLoop]: Abstraction has 4901 states and 15405 transitions. [2019-12-27 16:44:25,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:44:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 15405 transitions. [2019-12-27 16:44:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:25,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:25,035 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:25,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-27 16:44:25,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:25,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400268262] [2019-12-27 16:44:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:25,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400268262] [2019-12-27 16:44:25,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:25,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:25,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962067935] [2019-12-27 16:44:25,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:25,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:25,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 395 transitions. [2019-12-27 16:44:25,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:25,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:44:25,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:25,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:25,458 INFO L87 Difference]: Start difference. First operand 4901 states and 15405 transitions. Second operand 5 states. [2019-12-27 16:44:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:25,714 INFO L93 Difference]: Finished difference Result 5462 states and 16995 transitions. [2019-12-27 16:44:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:25,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 16:44:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:25,729 INFO L225 Difference]: With dead ends: 5462 [2019-12-27 16:44:25,729 INFO L226 Difference]: Without dead ends: 5462 [2019-12-27 16:44:25,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-12-27 16:44:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 5141. [2019-12-27 16:44:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5141 states. [2019-12-27 16:44:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 16117 transitions. [2019-12-27 16:44:25,860 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 16117 transitions. Word has length 74 [2019-12-27 16:44:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:25,860 INFO L462 AbstractCegarLoop]: Abstraction has 5141 states and 16117 transitions. [2019-12-27 16:44:25,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 16117 transitions. [2019-12-27 16:44:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:25,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:25,873 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:25,873 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:25,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-27 16:44:25,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:25,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150055458] [2019-12-27 16:44:25,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:26,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150055458] [2019-12-27 16:44:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:26,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:44:26,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844301560] [2019-12-27 16:44:26,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:26,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:26,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 420 transitions. [2019-12-27 16:44:26,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:26,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:44:26,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:44:26,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:44:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:44:26,566 INFO L87 Difference]: Start difference. First operand 5141 states and 16117 transitions. Second operand 10 states. [2019-12-27 16:44:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:28,721 INFO L93 Difference]: Finished difference Result 12947 states and 39430 transitions. [2019-12-27 16:44:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:44:28,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-12-27 16:44:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:28,748 INFO L225 Difference]: With dead ends: 12947 [2019-12-27 16:44:28,748 INFO L226 Difference]: Without dead ends: 12947 [2019-12-27 16:44:28,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:44:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12947 states. [2019-12-27 16:44:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12947 to 5589. [2019-12-27 16:44:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2019-12-27 16:44:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 17481 transitions. [2019-12-27 16:44:28,936 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 17481 transitions. Word has length 74 [2019-12-27 16:44:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:28,937 INFO L462 AbstractCegarLoop]: Abstraction has 5589 states and 17481 transitions. [2019-12-27 16:44:28,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:44:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 17481 transitions. [2019-12-27 16:44:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:28,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:28,949 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:28,950 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1912498904, now seen corresponding path program 4 times [2019-12-27 16:44:28,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:28,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428667252] [2019-12-27 16:44:28,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:29,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428667252] [2019-12-27 16:44:29,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:29,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:29,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130540338] [2019-12-27 16:44:29,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:29,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:29,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 473 transitions. [2019-12-27 16:44:29,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:29,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:29,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:29,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:29,485 INFO L87 Difference]: Start difference. First operand 5589 states and 17481 transitions. Second operand 4 states. [2019-12-27 16:44:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:29,579 INFO L93 Difference]: Finished difference Result 8253 states and 24456 transitions. [2019-12-27 16:44:29,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:44:29,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-27 16:44:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:29,585 INFO L225 Difference]: With dead ends: 8253 [2019-12-27 16:44:29,585 INFO L226 Difference]: Without dead ends: 2979 [2019-12-27 16:44:29,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2019-12-27 16:44:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2979. [2019-12-27 16:44:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2979 states. [2019-12-27 16:44:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 7814 transitions. [2019-12-27 16:44:29,625 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 7814 transitions. Word has length 74 [2019-12-27 16:44:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:29,626 INFO L462 AbstractCegarLoop]: Abstraction has 2979 states and 7814 transitions. [2019-12-27 16:44:29,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 7814 transitions. [2019-12-27 16:44:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:29,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:29,632 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:29,632 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1386364252, now seen corresponding path program 5 times [2019-12-27 16:44:29,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:29,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891550975] [2019-12-27 16:44:29,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:29,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891550975] [2019-12-27 16:44:29,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:29,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:44:29,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206284869] [2019-12-27 16:44:29,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:29,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:30,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 405 transitions. [2019-12-27 16:44:30,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:30,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:30,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:30,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:30,078 INFO L87 Difference]: Start difference. First operand 2979 states and 7814 transitions. Second operand 5 states. [2019-12-27 16:44:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:30,144 INFO L93 Difference]: Finished difference Result 3352 states and 8501 transitions. [2019-12-27 16:44:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:30,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 16:44:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:30,149 INFO L225 Difference]: With dead ends: 3352 [2019-12-27 16:44:30,149 INFO L226 Difference]: Without dead ends: 1837 [2019-12-27 16:44:30,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-12-27 16:44:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2019-12-27 16:44:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-27 16:44:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 4150 transitions. [2019-12-27 16:44:30,187 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 4150 transitions. Word has length 74 [2019-12-27 16:44:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:30,188 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 4150 transitions. [2019-12-27 16:44:30,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 4150 transitions. [2019-12-27 16:44:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:30,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:30,193 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:30,194 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1120678440, now seen corresponding path program 6 times [2019-12-27 16:44:30,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:30,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315586302] [2019-12-27 16:44:30,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:30,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315586302] [2019-12-27 16:44:30,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:30,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:44:30,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741189371] [2019-12-27 16:44:30,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:30,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:30,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 351 transitions. [2019-12-27 16:44:30,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:30,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:44:30,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:44:30,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:44:30,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:30,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:44:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:44:30,770 INFO L87 Difference]: Start difference. First operand 1837 states and 4150 transitions. Second operand 12 states. [2019-12-27 16:44:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:33,887 INFO L93 Difference]: Finished difference Result 7120 states and 16239 transitions. [2019-12-27 16:44:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 16:44:33,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-12-27 16:44:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:33,897 INFO L225 Difference]: With dead ends: 7120 [2019-12-27 16:44:33,897 INFO L226 Difference]: Without dead ends: 7120 [2019-12-27 16:44:33,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:44:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7120 states. [2019-12-27 16:44:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7120 to 2138. [2019-12-27 16:44:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-12-27 16:44:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 4915 transitions. [2019-12-27 16:44:33,961 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 4915 transitions. Word has length 74 [2019-12-27 16:44:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:33,961 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 4915 transitions. [2019-12-27 16:44:33,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:44:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 4915 transitions. [2019-12-27 16:44:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:33,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:33,967 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:33,967 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1587651062, now seen corresponding path program 7 times [2019-12-27 16:44:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322762642] [2019-12-27 16:44:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:34,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322762642] [2019-12-27 16:44:34,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:34,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:34,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878268449] [2019-12-27 16:44:34,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:34,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:34,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 243 transitions. [2019-12-27 16:44:34,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:34,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:34,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:34,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:34,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:34,271 INFO L87 Difference]: Start difference. First operand 2138 states and 4915 transitions. Second operand 5 states. [2019-12-27 16:44:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:34,466 INFO L93 Difference]: Finished difference Result 3942 states and 9011 transitions. [2019-12-27 16:44:34,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:34,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 16:44:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:34,468 INFO L225 Difference]: With dead ends: 3942 [2019-12-27 16:44:34,468 INFO L226 Difference]: Without dead ends: 776 [2019-12-27 16:44:34,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-27 16:44:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 539. [2019-12-27 16:44:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 16:44:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 976 transitions. [2019-12-27 16:44:34,480 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 976 transitions. Word has length 74 [2019-12-27 16:44:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:34,480 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 976 transitions. [2019-12-27 16:44:34,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 976 transitions. [2019-12-27 16:44:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:34,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:34,482 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:34,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash -433976880, now seen corresponding path program 8 times [2019-12-27 16:44:34,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825435954] [2019-12-27 16:44:34,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:34,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-27 16:44:34,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825435954] [2019-12-27 16:44:34,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:34,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:44:34,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992723411] [2019-12-27 16:44:34,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:34,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:34,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 265 transitions. [2019-12-27 16:44:34,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:35,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:44:35,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:44:35,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:44:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:35,014 INFO L87 Difference]: Start difference. First operand 539 states and 976 transitions. Second operand 7 states. [2019-12-27 16:44:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:35,365 INFO L93 Difference]: Finished difference Result 729 states and 1312 transitions. [2019-12-27 16:44:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:35,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-27 16:44:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:35,367 INFO L225 Difference]: With dead ends: 729 [2019-12-27 16:44:35,367 INFO L226 Difference]: Without dead ends: 729 [2019-12-27 16:44:35,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:44:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-27 16:44:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 530. [2019-12-27 16:44:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-12-27 16:44:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 958 transitions. [2019-12-27 16:44:35,374 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 958 transitions. Word has length 74 [2019-12-27 16:44:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:35,374 INFO L462 AbstractCegarLoop]: Abstraction has 530 states and 958 transitions. [2019-12-27 16:44:35,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:44:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 958 transitions. [2019-12-27 16:44:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 16:44:35,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:35,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:35,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1429844161, now seen corresponding path program 1 times [2019-12-27 16:44:35,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:35,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306734647] [2019-12-27 16:44:35,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:35,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306734647] [2019-12-27 16:44:35,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:35,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:35,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062660754] [2019-12-27 16:44:35,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:35,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:35,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 262 transitions. [2019-12-27 16:44:35,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:35,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:35,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:44:35,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:44:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:35,764 INFO L87 Difference]: Start difference. First operand 530 states and 958 transitions. Second operand 7 states. [2019-12-27 16:44:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:35,905 INFO L93 Difference]: Finished difference Result 1029 states and 1878 transitions. [2019-12-27 16:44:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:35,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-27 16:44:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:35,906 INFO L225 Difference]: With dead ends: 1029 [2019-12-27 16:44:35,906 INFO L226 Difference]: Without dead ends: 524 [2019-12-27 16:44:35,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:44:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-27 16:44:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 440. [2019-12-27 16:44:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-12-27 16:44:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 783 transitions. [2019-12-27 16:44:35,915 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 783 transitions. Word has length 75 [2019-12-27 16:44:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:35,915 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 783 transitions. [2019-12-27 16:44:35,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:44:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 783 transitions. [2019-12-27 16:44:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 16:44:35,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:35,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:35,917 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1721238743, now seen corresponding path program 1 times [2019-12-27 16:44:35,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:35,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617376725] [2019-12-27 16:44:35,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:35,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617376725] [2019-12-27 16:44:35,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:35,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:35,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23001395] [2019-12-27 16:44:35,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:36,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:36,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 267 transitions. [2019-12-27 16:44:36,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:36,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:44:36,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:36,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:36,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:36,232 INFO L87 Difference]: Start difference. First operand 440 states and 783 transitions. Second operand 4 states. [2019-12-27 16:44:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:36,381 INFO L93 Difference]: Finished difference Result 503 states and 853 transitions. [2019-12-27 16:44:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:36,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-27 16:44:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:36,382 INFO L225 Difference]: With dead ends: 503 [2019-12-27 16:44:36,383 INFO L226 Difference]: Without dead ends: 503 [2019-12-27 16:44:36,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-27 16:44:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 414. [2019-12-27 16:44:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-27 16:44:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 712 transitions. [2019-12-27 16:44:36,388 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 712 transitions. Word has length 76 [2019-12-27 16:44:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:36,388 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 712 transitions. [2019-12-27 16:44:36,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 712 transitions. [2019-12-27 16:44:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 16:44:36,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:36,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:36,390 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1450567251, now seen corresponding path program 1 times [2019-12-27 16:44:36,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:36,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898708870] [2019-12-27 16:44:36,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:36,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898708870] [2019-12-27 16:44:36,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:36,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280572636] [2019-12-27 16:44:36,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:36,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:36,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 281 transitions. [2019-12-27 16:44:36,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:36,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:36,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:36,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:36,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:36,751 INFO L87 Difference]: Start difference. First operand 414 states and 712 transitions. Second operand 3 states. [2019-12-27 16:44:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:36,788 INFO L93 Difference]: Finished difference Result 413 states and 710 transitions. [2019-12-27 16:44:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:36,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-27 16:44:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:36,789 INFO L225 Difference]: With dead ends: 413 [2019-12-27 16:44:36,789 INFO L226 Difference]: Without dead ends: 413 [2019-12-27 16:44:36,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-27 16:44:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 277. [2019-12-27 16:44:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-27 16:44:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 462 transitions. [2019-12-27 16:44:36,797 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 462 transitions. Word has length 76 [2019-12-27 16:44:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:36,797 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 462 transitions. [2019-12-27 16:44:36,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 462 transitions. [2019-12-27 16:44:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 16:44:36,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:36,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:36,805 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 1 times [2019-12-27 16:44:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672822870] [2019-12-27 16:44:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:37,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672822870] [2019-12-27 16:44:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:44:37,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050949919] [2019-12-27 16:44:37,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:37,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:37,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 242 transitions. [2019-12-27 16:44:37,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:37,383 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:37,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:44:37,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:44:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:44:37,384 INFO L87 Difference]: Start difference. First operand 277 states and 462 transitions. Second operand 14 states. [2019-12-27 16:44:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:38,344 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2019-12-27 16:44:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:44:38,344 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2019-12-27 16:44:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:38,346 INFO L225 Difference]: With dead ends: 642 [2019-12-27 16:44:38,346 INFO L226 Difference]: Without dead ends: 604 [2019-12-27 16:44:38,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:44:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-27 16:44:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 435. [2019-12-27 16:44:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-27 16:44:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 737 transitions. [2019-12-27 16:44:38,352 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 737 transitions. Word has length 77 [2019-12-27 16:44:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:38,353 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 737 transitions. [2019-12-27 16:44:38,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:44:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 737 transitions. [2019-12-27 16:44:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 16:44:38,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:38,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:38,354 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 2 times [2019-12-27 16:44:38,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:38,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573004540] [2019-12-27 16:44:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:44:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:44:38,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:44:38,503 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:44:38,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t829~0.base_24| 4) |v_#length_29|) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24| 1)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t829~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 |v_ULTIMATE.start_main_~#t829~0.offset_19|) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24|) |v_ULTIMATE.start_main_~#t829~0.offset_19| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24|)) (= v_~z$r_buff1_thd2~0_205 0) (= v_~z$r_buff1_thd0~0_494 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_18|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_23|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~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_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t829~0.base=|v_ULTIMATE.start_main_~#t829~0.base_24|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_18|, ULTIMATE.start_main_~#t829~0.offset=|v_ULTIMATE.start_main_~#t829~0.offset_19|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t832~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_~#t831~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t829~0.base, ULTIMATE.start_main_~#t832~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t831~0.offset, ULTIMATE.start_main_~#t829~0.offset, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:44:38,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t830~0.offset_9| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t830~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t830~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t830~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10|) |v_ULTIMATE.start_main_~#t830~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_9|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:44:38,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= |v_ULTIMATE.start_main_~#t831~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t831~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t831~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12|) |v_ULTIMATE.start_main_~#t831~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t831~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t831~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t831~0.base] because there is no mapped edge [2019-12-27 16:44:38,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t832~0.base_13|) (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13| 1) |v_#valid_52|) (= |v_ULTIMATE.start_main_~#t832~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t832~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t832~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13|) |v_ULTIMATE.start_main_~#t832~0.offset_11| 3)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t832~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t832~0.offset, #length] because there is no mapped edge [2019-12-27 16:44:38,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-27 16:44:38,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1332347356 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite11_Out1332347356| |P3Thread1of1ForFork3_#t~ite12_Out1332347356|)) (.cse1 (= (mod ~z$w_buff0_used~0_In1332347356 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out1332347356| ~z$w_buff1~0_In1332347356) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (= |P3Thread1of1ForFork3_#t~ite11_Out1332347356| ~z$w_buff0~0_In1332347356) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1332347356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1332347356, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1332347356, ~z$w_buff1~0=~z$w_buff1~0_In1332347356} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1332347356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1332347356, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1332347356|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1332347356, ~z$w_buff1~0=~z$w_buff1~0_In1332347356, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1332347356|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 16:44:38,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 16:44:38,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-929056452 256)))) (or (and .cse0 (= ~z~0_In-929056452 |P3Thread1of1ForFork3_#t~ite31_Out-929056452|)) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite31_Out-929056452| ~z$mem_tmp~0_In-929056452)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-929056452, ~z$flush_delayed~0=~z$flush_delayed~0_In-929056452, ~z~0=~z~0_In-929056452} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-929056452, ~z$flush_delayed~0=~z$flush_delayed~0_In-929056452, ~z~0=~z~0_In-929056452, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out-929056452|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:44:38,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:44:38,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:44:38,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-861623122 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-861623122 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite4_Out-861623122| |P2Thread1of1ForFork2_#t~ite3_Out-861623122|))) (or (and (or .cse0 .cse1) (= ~z~0_In-861623122 |P2Thread1of1ForFork2_#t~ite3_Out-861623122|) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-861623122 |P2Thread1of1ForFork2_#t~ite3_Out-861623122|) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-861623122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-861623122, ~z$w_buff1~0=~z$w_buff1~0_In-861623122, ~z~0=~z~0_In-861623122} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out-861623122|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-861623122|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-861623122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-861623122, ~z$w_buff1~0=~z$w_buff1~0_In-861623122, ~z~0=~z~0_In-861623122} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 16:44:38,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In550548219 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In550548219 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In550548219 |P2Thread1of1ForFork2_#t~ite5_Out550548219|)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out550548219| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In550548219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In550548219} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out550548219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In550548219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In550548219} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:44:38,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1082594554 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1082594554 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1082594554 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1082594554 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out1082594554| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out1082594554| ~z$w_buff1_used~0_In1082594554)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1082594554, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1082594554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1082594554, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1082594554} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1082594554|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1082594554, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1082594554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1082594554, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1082594554} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:44:38,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In320863466 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In320863466 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out320863466|)) (and (= ~z$r_buff0_thd3~0_In320863466 |P2Thread1of1ForFork2_#t~ite7_Out320863466|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In320863466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320863466} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In320863466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In320863466, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out320863466|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:44:38,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-64025876 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-64025876 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-64025876 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-64025876 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-64025876|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-64025876 |P2Thread1of1ForFork2_#t~ite8_Out-64025876|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-64025876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-64025876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-64025876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-64025876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-64025876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-64025876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-64025876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-64025876, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-64025876|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:44:38,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:44:38,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1983382336 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1983382336 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite34_Out1983382336|) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite34_Out1983382336| ~z$w_buff0_used~0_In1983382336) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1983382336, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1983382336} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1983382336, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1983382336, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out1983382336|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-27 16:44:38,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1893459227 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1893459227 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1893459227 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1893459227 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite35_Out-1893459227|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1893459227 |P3Thread1of1ForFork3_#t~ite35_Out-1893459227|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1893459227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1893459227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1893459227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1893459227} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1893459227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1893459227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1893459227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1893459227, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out-1893459227|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-27 16:44:38,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1506512324 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1506512324 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-1506512324 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-1506512324 ~z$r_buff0_thd4~0_In-1506512324)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1506512324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1506512324} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1506512324, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out-1506512324|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1506512324} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 16:44:38,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In509060589 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In509060589 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In509060589 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In509060589 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite37_Out509060589| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite37_Out509060589| ~z$r_buff1_thd4~0_In509060589) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In509060589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In509060589, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In509060589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In509060589} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In509060589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In509060589, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out509060589|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In509060589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In509060589} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-27 16:44:38,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:44:38,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:44:38,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In303711681 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In303711681 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In303711681 |ULTIMATE.start_main_#t~ite42_Out303711681|)) (and (or .cse1 .cse0) (= ~z~0_In303711681 |ULTIMATE.start_main_#t~ite42_Out303711681|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In303711681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In303711681, ~z$w_buff1~0=~z$w_buff1~0_In303711681, ~z~0=~z~0_In303711681} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In303711681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In303711681, ~z$w_buff1~0=~z$w_buff1~0_In303711681, ~z~0=~z~0_In303711681, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out303711681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:44:38,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:44:38,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1701102339 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1701102339 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1701102339|)) (and (= ~z$w_buff0_used~0_In1701102339 |ULTIMATE.start_main_#t~ite44_Out1701102339|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1701102339, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1701102339} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1701102339, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1701102339, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1701102339|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:44:38,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In710193472 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In710193472 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In710193472 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In710193472 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out710193472| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out710193472| ~z$w_buff1_used~0_In710193472)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In710193472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710193472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In710193472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710193472} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In710193472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710193472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In710193472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710193472, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out710193472|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:44:38,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1629145147 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1629145147 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1629145147| ~z$r_buff0_thd0~0_In1629145147)) (and (= |ULTIMATE.start_main_#t~ite46_Out1629145147| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1629145147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1629145147} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1629145147, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1629145147, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1629145147|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:44:38,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-109618460 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-109618460 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-109618460 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-109618460 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-109618460| ~z$r_buff1_thd0~0_In-109618460) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite47_Out-109618460| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-109618460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-109618460, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-109618460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-109618460} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-109618460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-109618460, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-109618460, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-109618460|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-109618460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:44:38,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In104463463 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite70_Out104463463| ~z$mem_tmp~0_In104463463) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite70_Out104463463| ~z~0_In104463463) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In104463463, ~z$flush_delayed~0=~z$flush_delayed~0_In104463463, ~z~0=~z~0_In104463463} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In104463463, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out104463463|, ~z$flush_delayed~0=~z$flush_delayed~0_In104463463, ~z~0=~z~0_In104463463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-27 16:44:38,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:44:38,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:44:38 BasicIcfg [2019-12-27 16:44:38,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:44:38,664 INFO L168 Benchmark]: Toolchain (without parser) took 88241.53 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,664 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 906.42 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 153.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.91 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 149.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,666 INFO L168 Benchmark]: Boogie Preprocessor took 43.65 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,667 INFO L168 Benchmark]: RCFGBuilder took 1045.10 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 147.0 MB in the beginning and 202.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,668 INFO L168 Benchmark]: TraceAbstraction took 86155.23 ms. Allocated memory was 233.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 202.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:44:38,671 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 906.42 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 153.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.91 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 149.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.65 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1045.10 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 147.0 MB in the beginning and 202.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86155.23 ms. Allocated memory was 233.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 202.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.9s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t829, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L841] FCALL, FORK 0 pthread_create(&t830, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L843] FCALL, FORK 0 pthread_create(&t831, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L845] FCALL, FORK 0 pthread_create(&t832, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=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=3, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 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_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=3, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 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) [L802] 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_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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 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)) [L803] 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_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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 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)) [L804] 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_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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 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)) [L805] 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_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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 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)) [L807] 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_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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 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)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=3, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 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 [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=3, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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=2, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 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) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 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 [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3411 SDtfs, 5493 SDslu, 9582 SDs, 0 SdLazy, 6588 SolverSat, 546 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 136 SyntacticMatches, 24 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 24798 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1074 NumberOfCodeBlocks, 1074 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 979 ConstructedInterpolants, 0 QuantifiedInterpolants, 202638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...