./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f307346aec6f29e68c8dfd90bd8a8b0631cc8549 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 05:14:47,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:14:47,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:14:47,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:14:47,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:14:47,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:14:47,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:14:47,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:14:47,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:14:47,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:14:47,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:14:47,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:14:47,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:14:47,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:14:47,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:14:47,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:14:47,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:14:47,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:14:47,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:14:47,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:14:47,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:14:47,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:14:47,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:14:47,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:14:47,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:14:47,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:14:47,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:14:47,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:14:47,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:14:47,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:14:47,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:14:47,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:14:47,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:14:47,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:14:47,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:14:47,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:14:47,650 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:14:47,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:14:47,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:14:47,658 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:14:47,658 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:14:47,658 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:14:47,658 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:14:47,658 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:14:47,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:14:47,658 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:14:47,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:14:47,659 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:14:47,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:14:47,660 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:14:47,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:14:47,661 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f307346aec6f29e68c8dfd90bd8a8b0631cc8549 [2018-12-03 05:14:47,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:14:47,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:14:47,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:14:47,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:14:47,689 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:14:47,690 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-03 05:14:47,726 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/data/df3b0f24e/1bfb69451ab847a588720b936c48ed50/FLAG7097546ac [2018-12-03 05:14:48,173 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:14:48,174 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-03 05:14:48,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/data/df3b0f24e/1bfb69451ab847a588720b936c48ed50/FLAG7097546ac [2018-12-03 05:14:48,189 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/data/df3b0f24e/1bfb69451ab847a588720b936c48ed50 [2018-12-03 05:14:48,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:14:48,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:14:48,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:14:48,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:14:48,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:14:48,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48, skipping insertion in model container [2018-12-03 05:14:48,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:14:48,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:14:48,410 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:14:48,418 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:14:48,492 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:14:48,521 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:14:48,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48 WrapperNode [2018-12-03 05:14:48,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:14:48,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:14:48,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:14:48,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:14:48,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:14:48,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:14:48,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:14:48,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:14:48,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... [2018-12-03 05:14:48,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:14:48,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:14:48,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:14:48,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:14:48,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/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 [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 05:14:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 05:14:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 05:14:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 05:14:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 05:14:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 05:14:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:14:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:14:48,610 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 05:14:48,965 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:14:48,966 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 05:14:48,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:48 BoogieIcfgContainer [2018-12-03 05:14:48,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:14:48,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:14:48,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:14:48,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:14:48,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:14:48" (1/3) ... [2018-12-03 05:14:48,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550a2a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:14:48, skipping insertion in model container [2018-12-03 05:14:48,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:14:48" (2/3) ... [2018-12-03 05:14:48,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550a2a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:14:48, skipping insertion in model container [2018-12-03 05:14:48,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:48" (3/3) ... [2018-12-03 05:14:48,971 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015_pso.opt_false-unreach-call.i [2018-12-03 05:14:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,020 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:14:49,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 05:14:49,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:14:49,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 05:14:49,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 05:14:49,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:14:49,073 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:14:49,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:14:49,073 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:14:49,073 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:14:49,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:14:49,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:14:49,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:14:49,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 190places, 242 transitions [2018-12-03 05:17:23,186 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445147 states. [2018-12-03 05:17:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 445147 states. [2018-12-03 05:17:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 05:17:23,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:17:23,198 INFO L402 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] [2018-12-03 05:17:23,199 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:17:23,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:17:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash -339585471, now seen corresponding path program 1 times [2018-12-03 05:17:23,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:17:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:17:23,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:17:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:17:23,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:17:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:17:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:17:23,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:17:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:17:23,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:17:23,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:17:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:17:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:17:23,382 INFO L87 Difference]: Start difference. First operand 445147 states. Second operand 4 states. [2018-12-03 05:17:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:17:32,383 INFO L93 Difference]: Finished difference Result 810627 states and 3886644 transitions. [2018-12-03 05:17:32,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:17:32,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-03 05:17:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:17:34,263 INFO L225 Difference]: With dead ends: 810627 [2018-12-03 05:17:34,263 INFO L226 Difference]: Without dead ends: 530977 [2018-12-03 05:17:34,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:17:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530977 states. [2018-12-03 05:17:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530977 to 307957. [2018-12-03 05:17:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-03 05:17:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1493658 transitions. [2018-12-03 05:17:48,215 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1493658 transitions. Word has length 48 [2018-12-03 05:17:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:17:48,216 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1493658 transitions. [2018-12-03 05:17:48,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:17:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1493658 transitions. [2018-12-03 05:17:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:17:48,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:17:48,228 INFO L402 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] [2018-12-03 05:17:48,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:17:48,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:17:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -48370061, now seen corresponding path program 1 times [2018-12-03 05:17:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:17:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:17:48,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:17:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:17:48,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:17:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:17:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:17:48,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:17:48,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:17:48,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:17:48,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:17:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:17:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:17:48,290 INFO L87 Difference]: Start difference. First operand 307957 states and 1493658 transitions. Second operand 3 states. [2018-12-03 05:17:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:17:53,024 INFO L93 Difference]: Finished difference Result 307957 states and 1492633 transitions. [2018-12-03 05:17:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:17:53,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 05:17:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:17:53,905 INFO L225 Difference]: With dead ends: 307957 [2018-12-03 05:17:53,905 INFO L226 Difference]: Without dead ends: 307957 [2018-12-03 05:17:53,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:17:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307957 states. [2018-12-03 05:18:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307957 to 307957. [2018-12-03 05:18:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-03 05:18:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1492633 transitions. [2018-12-03 05:18:03,962 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1492633 transitions. Word has length 56 [2018-12-03 05:18:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:03,963 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1492633 transitions. [2018-12-03 05:18:03,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:18:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1492633 transitions. [2018-12-03 05:18:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:18:03,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:03,969 INFO L402 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] [2018-12-03 05:18:03,969 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:03,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1694440274, now seen corresponding path program 1 times [2018-12-03 05:18:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:03,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:18:04,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:04,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:18:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:18:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:18:04,038 INFO L87 Difference]: Start difference. First operand 307957 states and 1492633 transitions. Second operand 4 states. [2018-12-03 05:18:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:08,084 INFO L93 Difference]: Finished difference Result 272411 states and 1286588 transitions. [2018-12-03 05:18:08,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:18:08,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 05:18:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:09,071 INFO L225 Difference]: With dead ends: 272411 [2018-12-03 05:18:09,072 INFO L226 Difference]: Without dead ends: 258311 [2018-12-03 05:18:09,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:18:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258311 states. [2018-12-03 05:18:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258311 to 258311. [2018-12-03 05:18:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258311 states. [2018-12-03 05:18:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258311 states to 258311 states and 1232395 transitions. [2018-12-03 05:18:17,530 INFO L78 Accepts]: Start accepts. Automaton has 258311 states and 1232395 transitions. Word has length 56 [2018-12-03 05:18:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:17,530 INFO L480 AbstractCegarLoop]: Abstraction has 258311 states and 1232395 transitions. [2018-12-03 05:18:17,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:18:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 258311 states and 1232395 transitions. [2018-12-03 05:18:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:18:17,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:17,536 INFO L402 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] [2018-12-03 05:18:17,536 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:17,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1611734580, now seen corresponding path program 1 times [2018-12-03 05:18:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:17,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:17,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:17,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:18:17,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:17,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:18:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:18:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:18:17,575 INFO L87 Difference]: Start difference. First operand 258311 states and 1232395 transitions. Second operand 5 states. [2018-12-03 05:18:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:17,829 INFO L93 Difference]: Finished difference Result 61671 states and 252911 transitions. [2018-12-03 05:18:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:18:17,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 05:18:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:17,931 INFO L225 Difference]: With dead ends: 61671 [2018-12-03 05:18:17,931 INFO L226 Difference]: Without dead ends: 49979 [2018-12-03 05:18:17,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:18:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49979 states. [2018-12-03 05:18:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49979 to 49519. [2018-12-03 05:18:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49519 states. [2018-12-03 05:18:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49519 states to 49519 states and 199433 transitions. [2018-12-03 05:18:18,633 INFO L78 Accepts]: Start accepts. Automaton has 49519 states and 199433 transitions. Word has length 57 [2018-12-03 05:18:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:18,633 INFO L480 AbstractCegarLoop]: Abstraction has 49519 states and 199433 transitions. [2018-12-03 05:18:18,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:18:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49519 states and 199433 transitions. [2018-12-03 05:18:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:18:18,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:18,636 INFO L402 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] [2018-12-03 05:18:18,636 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:18,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 982354872, now seen corresponding path program 1 times [2018-12-03 05:18:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:18,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:18,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:18,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:18,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:18:18,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:18,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:18:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:18:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:18:18,686 INFO L87 Difference]: Start difference. First operand 49519 states and 199433 transitions. Second operand 5 states. [2018-12-03 05:18:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:20,775 INFO L93 Difference]: Finished difference Result 100165 states and 398362 transitions. [2018-12-03 05:18:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:18:20,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 05:18:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:20,977 INFO L225 Difference]: With dead ends: 100165 [2018-12-03 05:18:20,977 INFO L226 Difference]: Without dead ends: 99790 [2018-12-03 05:18:20,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:18:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99790 states. [2018-12-03 05:18:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99790 to 66558. [2018-12-03 05:18:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66558 states. [2018-12-03 05:18:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 261441 transitions. [2018-12-03 05:18:22,140 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 261441 transitions. Word has length 57 [2018-12-03 05:18:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:22,140 INFO L480 AbstractCegarLoop]: Abstraction has 66558 states and 261441 transitions. [2018-12-03 05:18:22,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:18:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 261441 transitions. [2018-12-03 05:18:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 05:18:22,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:22,143 INFO L402 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] [2018-12-03 05:18:22,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 32807518, now seen corresponding path program 1 times [2018-12-03 05:18:22,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:22,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:22,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:22,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:22,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:18:22,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:22,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:18:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:18:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:18:22,174 INFO L87 Difference]: Start difference. First operand 66558 states and 261441 transitions. Second operand 3 states. [2018-12-03 05:18:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:22,780 INFO L93 Difference]: Finished difference Result 122934 states and 477436 transitions. [2018-12-03 05:18:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:18:22,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 05:18:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:23,033 INFO L225 Difference]: With dead ends: 122934 [2018-12-03 05:18:23,033 INFO L226 Difference]: Without dead ends: 122914 [2018-12-03 05:18:23,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:18:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122914 states. [2018-12-03 05:18:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122914 to 103769. [2018-12-03 05:18:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103769 states. [2018-12-03 05:18:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103769 states to 103769 states and 403303 transitions. [2018-12-03 05:18:24,927 INFO L78 Accepts]: Start accepts. Automaton has 103769 states and 403303 transitions. Word has length 59 [2018-12-03 05:18:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:24,927 INFO L480 AbstractCegarLoop]: Abstraction has 103769 states and 403303 transitions. [2018-12-03 05:18:24,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:18:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 103769 states and 403303 transitions. [2018-12-03 05:18:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 05:18:24,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:24,935 INFO L402 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] [2018-12-03 05:18:24,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:24,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash -10742871, now seen corresponding path program 1 times [2018-12-03 05:18:24,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:24,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:24,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:24,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:24,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:24,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:18:24,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:24,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:18:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:18:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:18:24,993 INFO L87 Difference]: Start difference. First operand 103769 states and 403303 transitions. Second operand 6 states. [2018-12-03 05:18:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:25,887 INFO L93 Difference]: Finished difference Result 144371 states and 554294 transitions. [2018-12-03 05:18:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:18:25,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-03 05:18:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:26,187 INFO L225 Difference]: With dead ends: 144371 [2018-12-03 05:18:26,187 INFO L226 Difference]: Without dead ends: 143886 [2018-12-03 05:18:26,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:18:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143886 states. [2018-12-03 05:18:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143886 to 102870. [2018-12-03 05:18:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102870 states. [2018-12-03 05:18:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102870 states to 102870 states and 400166 transitions. [2018-12-03 05:18:28,147 INFO L78 Accepts]: Start accepts. Automaton has 102870 states and 400166 transitions. Word has length 63 [2018-12-03 05:18:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:28,147 INFO L480 AbstractCegarLoop]: Abstraction has 102870 states and 400166 transitions. [2018-12-03 05:18:28,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:18:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 102870 states and 400166 transitions. [2018-12-03 05:18:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 05:18:28,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:28,173 INFO L402 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] [2018-12-03 05:18:28,173 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:28,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1142982587, now seen corresponding path program 1 times [2018-12-03 05:18:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:28,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:28,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:28,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:18:28,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:28,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:18:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:18:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:18:28,215 INFO L87 Difference]: Start difference. First operand 102870 states and 400166 transitions. Second operand 6 states. [2018-12-03 05:18:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:29,725 INFO L93 Difference]: Finished difference Result 243644 states and 935211 transitions. [2018-12-03 05:18:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:18:29,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-03 05:18:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:30,268 INFO L225 Difference]: With dead ends: 243644 [2018-12-03 05:18:30,268 INFO L226 Difference]: Without dead ends: 243324 [2018-12-03 05:18:30,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:18:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243324 states. [2018-12-03 05:18:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243324 to 150402. [2018-12-03 05:18:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150402 states. [2018-12-03 05:18:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150402 states to 150402 states and 573385 transitions. [2018-12-03 05:18:33,528 INFO L78 Accepts]: Start accepts. Automaton has 150402 states and 573385 transitions. Word has length 74 [2018-12-03 05:18:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:33,528 INFO L480 AbstractCegarLoop]: Abstraction has 150402 states and 573385 transitions. [2018-12-03 05:18:33,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:18:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 150402 states and 573385 transitions. [2018-12-03 05:18:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 05:18:33,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:33,577 INFO L402 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, 1, 1, 1] [2018-12-03 05:18:33,577 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:33,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1023418068, now seen corresponding path program 1 times [2018-12-03 05:18:33,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:33,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:33,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:33,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:33,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:18:33,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:33,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:18:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:18:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:18:33,619 INFO L87 Difference]: Start difference. First operand 150402 states and 573385 transitions. Second operand 3 states. [2018-12-03 05:18:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:34,251 INFO L93 Difference]: Finished difference Result 174266 states and 657250 transitions. [2018-12-03 05:18:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:18:34,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 05:18:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:34,603 INFO L225 Difference]: With dead ends: 174266 [2018-12-03 05:18:34,603 INFO L226 Difference]: Without dead ends: 174266 [2018-12-03 05:18:34,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:18:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174266 states. [2018-12-03 05:18:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174266 to 151426. [2018-12-03 05:18:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151426 states. [2018-12-03 05:18:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151426 states to 151426 states and 568100 transitions. [2018-12-03 05:18:39,036 INFO L78 Accepts]: Start accepts. Automaton has 151426 states and 568100 transitions. Word has length 80 [2018-12-03 05:18:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:39,037 INFO L480 AbstractCegarLoop]: Abstraction has 151426 states and 568100 transitions. [2018-12-03 05:18:39,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:18:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 151426 states and 568100 transitions. [2018-12-03 05:18:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 05:18:39,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:39,087 INFO L402 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, 1, 1, 1, 1] [2018-12-03 05:18:39,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:39,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1370215840, now seen corresponding path program 1 times [2018-12-03 05:18:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:39,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:39,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:18:39,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:39,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:18:39,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:18:39,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:18:39,145 INFO L87 Difference]: Start difference. First operand 151426 states and 568100 transitions. Second operand 7 states. [2018-12-03 05:18:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:40,828 INFO L93 Difference]: Finished difference Result 222416 states and 833740 transitions. [2018-12-03 05:18:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:18:40,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-03 05:18:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:41,305 INFO L225 Difference]: With dead ends: 222416 [2018-12-03 05:18:41,306 INFO L226 Difference]: Without dead ends: 221168 [2018-12-03 05:18:41,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:18:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221168 states. [2018-12-03 05:18:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221168 to 201770. [2018-12-03 05:18:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201770 states. [2018-12-03 05:18:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201770 states to 201770 states and 757504 transitions. [2018-12-03 05:18:45,051 INFO L78 Accepts]: Start accepts. Automaton has 201770 states and 757504 transitions. Word has length 81 [2018-12-03 05:18:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:45,051 INFO L480 AbstractCegarLoop]: Abstraction has 201770 states and 757504 transitions. [2018-12-03 05:18:45,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:18:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 201770 states and 757504 transitions. [2018-12-03 05:18:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 05:18:45,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:45,133 INFO L402 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, 1, 1, 1, 1] [2018-12-03 05:18:45,133 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:45,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1127800097, now seen corresponding path program 1 times [2018-12-03 05:18:45,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:45,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:45,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:45,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:45,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:18:45,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:45,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:18:45,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:18:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:18:45,220 INFO L87 Difference]: Start difference. First operand 201770 states and 757504 transitions. Second operand 8 states. [2018-12-03 05:18:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:46,842 INFO L93 Difference]: Finished difference Result 242896 states and 902540 transitions. [2018-12-03 05:18:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:18:46,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-03 05:18:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:47,399 INFO L225 Difference]: With dead ends: 242896 [2018-12-03 05:18:47,399 INFO L226 Difference]: Without dead ends: 242896 [2018-12-03 05:18:47,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:18:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242896 states. [2018-12-03 05:18:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242896 to 213274. [2018-12-03 05:18:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213274 states. [2018-12-03 05:18:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213274 states to 213274 states and 798104 transitions. [2018-12-03 05:18:54,747 INFO L78 Accepts]: Start accepts. Automaton has 213274 states and 798104 transitions. Word has length 81 [2018-12-03 05:18:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:54,748 INFO L480 AbstractCegarLoop]: Abstraction has 213274 states and 798104 transitions. [2018-12-03 05:18:54,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:18:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 213274 states and 798104 transitions. [2018-12-03 05:18:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 05:18:54,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:54,824 INFO L402 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, 1, 1, 1, 1] [2018-12-03 05:18:54,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:54,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303778, now seen corresponding path program 1 times [2018-12-03 05:18:54,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:54,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:54,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:54,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:54,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:54,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:54,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:18:54,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:18:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:18:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:18:54,867 INFO L87 Difference]: Start difference. First operand 213274 states and 798104 transitions. Second operand 6 states. [2018-12-03 05:18:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:55,075 INFO L93 Difference]: Finished difference Result 63146 states and 206992 transitions. [2018-12-03 05:18:55,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:18:55,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-03 05:18:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:55,154 INFO L225 Difference]: With dead ends: 63146 [2018-12-03 05:18:55,154 INFO L226 Difference]: Without dead ends: 54602 [2018-12-03 05:18:55,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:18:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54602 states. [2018-12-03 05:18:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54602 to 41747. [2018-12-03 05:18:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41747 states. [2018-12-03 05:18:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41747 states to 41747 states and 137174 transitions. [2018-12-03 05:18:55,717 INFO L78 Accepts]: Start accepts. Automaton has 41747 states and 137174 transitions. Word has length 81 [2018-12-03 05:18:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:55,717 INFO L480 AbstractCegarLoop]: Abstraction has 41747 states and 137174 transitions. [2018-12-03 05:18:55,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:18:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 41747 states and 137174 transitions. [2018-12-03 05:18:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 05:18:55,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:55,755 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:18:55,755 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:55,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1293928851, now seen corresponding path program 1 times [2018-12-03 05:18:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:55,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:55,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:18:55,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:55,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:18:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:18:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:18:55,791 INFO L87 Difference]: Start difference. First operand 41747 states and 137174 transitions. Second operand 4 states. [2018-12-03 05:18:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:56,168 INFO L93 Difference]: Finished difference Result 80185 states and 252826 transitions. [2018-12-03 05:18:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:18:56,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-03 05:18:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:56,263 INFO L225 Difference]: With dead ends: 80185 [2018-12-03 05:18:56,263 INFO L226 Difference]: Without dead ends: 80185 [2018-12-03 05:18:56,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:18:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80185 states. [2018-12-03 05:18:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80185 to 62671. [2018-12-03 05:18:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62671 states. [2018-12-03 05:18:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62671 states to 62671 states and 201573 transitions. [2018-12-03 05:18:57,292 INFO L78 Accepts]: Start accepts. Automaton has 62671 states and 201573 transitions. Word has length 109 [2018-12-03 05:18:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:57,292 INFO L480 AbstractCegarLoop]: Abstraction has 62671 states and 201573 transitions. [2018-12-03 05:18:57,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:18:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 62671 states and 201573 transitions. [2018-12-03 05:18:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 05:18:57,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:57,356 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:18:57,356 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:57,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:57,356 INFO L82 PathProgramCache]: Analyzing trace with hash -716174990, now seen corresponding path program 1 times [2018-12-03 05:18:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:57,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:57,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:57,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:18:57,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:57,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:18:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:18:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:18:57,452 INFO L87 Difference]: Start difference. First operand 62671 states and 201573 transitions. Second operand 7 states. [2018-12-03 05:18:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:58,010 INFO L93 Difference]: Finished difference Result 83776 states and 266262 transitions. [2018-12-03 05:18:58,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:18:58,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-03 05:18:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:58,126 INFO L225 Difference]: With dead ends: 83776 [2018-12-03 05:18:58,126 INFO L226 Difference]: Without dead ends: 83776 [2018-12-03 05:18:58,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:18:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83776 states. [2018-12-03 05:18:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83776 to 71866. [2018-12-03 05:18:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71866 states. [2018-12-03 05:18:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71866 states to 71866 states and 231184 transitions. [2018-12-03 05:18:59,053 INFO L78 Accepts]: Start accepts. Automaton has 71866 states and 231184 transitions. Word has length 109 [2018-12-03 05:18:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:18:59,053 INFO L480 AbstractCegarLoop]: Abstraction has 71866 states and 231184 transitions. [2018-12-03 05:18:59,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:18:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 71866 states and 231184 transitions. [2018-12-03 05:18:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 05:18:59,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:18:59,129 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:18:59,129 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:18:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:18:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -704858863, now seen corresponding path program 1 times [2018-12-03 05:18:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:18:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:59,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:18:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:18:59,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:18:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:18:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:18:59,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:18:59,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:18:59,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:18:59,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:18:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:18:59,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:18:59,174 INFO L87 Difference]: Start difference. First operand 71866 states and 231184 transitions. Second operand 5 states. [2018-12-03 05:18:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:18:59,610 INFO L93 Difference]: Finished difference Result 92579 states and 291802 transitions. [2018-12-03 05:18:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:18:59,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-03 05:18:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:18:59,731 INFO L225 Difference]: With dead ends: 92579 [2018-12-03 05:18:59,731 INFO L226 Difference]: Without dead ends: 92579 [2018-12-03 05:18:59,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:18:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92579 states. [2018-12-03 05:19:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92579 to 77586. [2018-12-03 05:19:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77586 states. [2018-12-03 05:19:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77586 states to 77586 states and 248155 transitions. [2018-12-03 05:19:00,835 INFO L78 Accepts]: Start accepts. Automaton has 77586 states and 248155 transitions. Word has length 109 [2018-12-03 05:19:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:00,835 INFO L480 AbstractCegarLoop]: Abstraction has 77586 states and 248155 transitions. [2018-12-03 05:19:00,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:19:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 77586 states and 248155 transitions. [2018-12-03 05:19:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 05:19:00,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:00,919 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:00,920 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:00,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:00,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1254991095, now seen corresponding path program 2 times [2018-12-03 05:19:00,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:00,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:00,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:00,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:00,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:00,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:19:00,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:00,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:19:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:19:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:19:00,998 INFO L87 Difference]: Start difference. First operand 77586 states and 248155 transitions. Second operand 6 states. [2018-12-03 05:19:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:01,283 INFO L93 Difference]: Finished difference Result 76882 states and 245163 transitions. [2018-12-03 05:19:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:19:01,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-03 05:19:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:01,385 INFO L225 Difference]: With dead ends: 76882 [2018-12-03 05:19:01,385 INFO L226 Difference]: Without dead ends: 76882 [2018-12-03 05:19:01,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:19:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76882 states. [2018-12-03 05:19:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76882 to 68158. [2018-12-03 05:19:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68158 states. [2018-12-03 05:19:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68158 states to 68158 states and 218472 transitions. [2018-12-03 05:19:02,273 INFO L78 Accepts]: Start accepts. Automaton has 68158 states and 218472 transitions. Word has length 109 [2018-12-03 05:19:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:02,273 INFO L480 AbstractCegarLoop]: Abstraction has 68158 states and 218472 transitions. [2018-12-03 05:19:02,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:19:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68158 states and 218472 transitions. [2018-12-03 05:19:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:02,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:02,343 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:02,344 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:02,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:02,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1321686208, now seen corresponding path program 1 times [2018-12-03 05:19:02,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:02,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:02,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:19:02,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:02,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:02,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:02,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:19:02,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:02,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:19:02,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:19:02,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:19:02,450 INFO L87 Difference]: Start difference. First operand 68158 states and 218472 transitions. Second operand 8 states. [2018-12-03 05:19:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:02,971 INFO L93 Difference]: Finished difference Result 77790 states and 246170 transitions. [2018-12-03 05:19:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:19:02,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-03 05:19:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:03,079 INFO L225 Difference]: With dead ends: 77790 [2018-12-03 05:19:03,079 INFO L226 Difference]: Without dead ends: 77790 [2018-12-03 05:19:03,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-03 05:19:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77790 states. [2018-12-03 05:19:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77790 to 72476. [2018-12-03 05:19:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72476 states. [2018-12-03 05:19:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72476 states to 72476 states and 231167 transitions. [2018-12-03 05:19:04,098 INFO L78 Accepts]: Start accepts. Automaton has 72476 states and 231167 transitions. Word has length 111 [2018-12-03 05:19:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:04,099 INFO L480 AbstractCegarLoop]: Abstraction has 72476 states and 231167 transitions. [2018-12-03 05:19:04,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:19:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 72476 states and 231167 transitions. [2018-12-03 05:19:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:04,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:04,169 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:04,169 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:04,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -434182527, now seen corresponding path program 1 times [2018-12-03 05:19:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:04,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:04,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:04,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:04,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:19:04,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:04,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:19:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:19:04,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:19:04,197 INFO L87 Difference]: Start difference. First operand 72476 states and 231167 transitions. Second operand 3 states. [2018-12-03 05:19:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:04,477 INFO L93 Difference]: Finished difference Result 92396 states and 294703 transitions. [2018-12-03 05:19:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:19:04,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-03 05:19:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:04,592 INFO L225 Difference]: With dead ends: 92396 [2018-12-03 05:19:04,592 INFO L226 Difference]: Without dead ends: 92396 [2018-12-03 05:19:04,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:19:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92396 states. [2018-12-03 05:19:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92396 to 92001. [2018-12-03 05:19:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92001 states. [2018-12-03 05:19:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92001 states to 92001 states and 293527 transitions. [2018-12-03 05:19:05,693 INFO L78 Accepts]: Start accepts. Automaton has 92001 states and 293527 transitions. Word has length 111 [2018-12-03 05:19:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:05,693 INFO L480 AbstractCegarLoop]: Abstraction has 92001 states and 293527 transitions. [2018-12-03 05:19:05,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:19:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92001 states and 293527 transitions. [2018-12-03 05:19:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:05,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:05,805 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:05,805 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:05,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -222831614, now seen corresponding path program 1 times [2018-12-03 05:19:05,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:05,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:05,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:05,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:19:05,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:05,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:19:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:19:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:19:05,922 INFO L87 Difference]: Start difference. First operand 92001 states and 293527 transitions. Second operand 5 states. [2018-12-03 05:19:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:06,437 INFO L93 Difference]: Finished difference Result 93761 states and 298100 transitions. [2018-12-03 05:19:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:19:06,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-03 05:19:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:06,556 INFO L225 Difference]: With dead ends: 93761 [2018-12-03 05:19:06,556 INFO L226 Difference]: Without dead ends: 93761 [2018-12-03 05:19:06,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:19:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93761 states. [2018-12-03 05:19:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93761 to 92991. [2018-12-03 05:19:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92991 states. [2018-12-03 05:19:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92991 states to 92991 states and 295784 transitions. [2018-12-03 05:19:07,613 INFO L78 Accepts]: Start accepts. Automaton has 92991 states and 295784 transitions. Word has length 111 [2018-12-03 05:19:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:07,614 INFO L480 AbstractCegarLoop]: Abstraction has 92991 states and 295784 transitions. [2018-12-03 05:19:07,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:19:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 92991 states and 295784 transitions. [2018-12-03 05:19:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:07,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:07,721 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:07,722 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1066091881, now seen corresponding path program 2 times [2018-12-03 05:19:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:07,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:07,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:07,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:19:07,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:19:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:19:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:19:07,778 INFO L87 Difference]: Start difference. First operand 92991 states and 295784 transitions. Second operand 4 states. [2018-12-03 05:19:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:08,380 INFO L93 Difference]: Finished difference Result 140039 states and 442619 transitions. [2018-12-03 05:19:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:19:08,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-03 05:19:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:08,565 INFO L225 Difference]: With dead ends: 140039 [2018-12-03 05:19:08,565 INFO L226 Difference]: Without dead ends: 140039 [2018-12-03 05:19:08,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:19:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140039 states. [2018-12-03 05:19:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140039 to 93676. [2018-12-03 05:19:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93676 states. [2018-12-03 05:19:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93676 states to 93676 states and 296712 transitions. [2018-12-03 05:19:10,075 INFO L78 Accepts]: Start accepts. Automaton has 93676 states and 296712 transitions. Word has length 111 [2018-12-03 05:19:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:10,075 INFO L480 AbstractCegarLoop]: Abstraction has 93676 states and 296712 transitions. [2018-12-03 05:19:10,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:19:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 93676 states and 296712 transitions. [2018-12-03 05:19:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:10,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:10,180 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:10,181 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:10,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1508732501, now seen corresponding path program 3 times [2018-12-03 05:19:10,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:10,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:10,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:19:10,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:10,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:10,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:19:10,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:10,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:19:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:19:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:19:10,246 INFO L87 Difference]: Start difference. First operand 93676 states and 296712 transitions. Second operand 6 states. [2018-12-03 05:19:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:10,721 INFO L93 Difference]: Finished difference Result 99416 states and 313354 transitions. [2018-12-03 05:19:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:19:10,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-03 05:19:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:10,864 INFO L225 Difference]: With dead ends: 99416 [2018-12-03 05:19:10,864 INFO L226 Difference]: Without dead ends: 99416 [2018-12-03 05:19:10,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:19:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99416 states. [2018-12-03 05:19:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99416 to 93676. [2018-12-03 05:19:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93676 states. [2018-12-03 05:19:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93676 states to 93676 states and 296342 transitions. [2018-12-03 05:19:11,977 INFO L78 Accepts]: Start accepts. Automaton has 93676 states and 296342 transitions. Word has length 111 [2018-12-03 05:19:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:11,977 INFO L480 AbstractCegarLoop]: Abstraction has 93676 states and 296342 transitions. [2018-12-03 05:19:11,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:19:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 93676 states and 296342 transitions. [2018-12-03 05:19:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:12,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:12,081 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:12,082 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:12,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash -450142267, now seen corresponding path program 4 times [2018-12-03 05:19:12,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:12,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:19:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:12,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:12,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:12,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:19:12,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:12,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:19:12,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:19:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:19:12,154 INFO L87 Difference]: Start difference. First operand 93676 states and 296342 transitions. Second operand 6 states. [2018-12-03 05:19:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:12,809 INFO L93 Difference]: Finished difference Result 111714 states and 352039 transitions. [2018-12-03 05:19:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:19:12,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-03 05:19:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:12,966 INFO L225 Difference]: With dead ends: 111714 [2018-12-03 05:19:12,967 INFO L226 Difference]: Without dead ends: 111714 [2018-12-03 05:19:12,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:19:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111714 states. [2018-12-03 05:19:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111714 to 94761. [2018-12-03 05:19:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94761 states. [2018-12-03 05:19:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94761 states to 94761 states and 299630 transitions. [2018-12-03 05:19:14,289 INFO L78 Accepts]: Start accepts. Automaton has 94761 states and 299630 transitions. Word has length 111 [2018-12-03 05:19:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:14,289 INFO L480 AbstractCegarLoop]: Abstraction has 94761 states and 299630 transitions. [2018-12-03 05:19:14,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:19:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 94761 states and 299630 transitions. [2018-12-03 05:19:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 05:19:14,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:14,396 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:14,396 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:14,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash -128549119, now seen corresponding path program 5 times [2018-12-03 05:19:14,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:14,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:14,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:14,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:14,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:19:14,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:14,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:19:14,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:19:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:19:14,430 INFO L87 Difference]: Start difference. First operand 94761 states and 299630 transitions. Second operand 5 states. [2018-12-03 05:19:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:14,879 INFO L93 Difference]: Finished difference Result 101444 states and 318558 transitions. [2018-12-03 05:19:14,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:19:14,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-03 05:19:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:15,027 INFO L225 Difference]: With dead ends: 101444 [2018-12-03 05:19:15,027 INFO L226 Difference]: Without dead ends: 101444 [2018-12-03 05:19:15,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:19:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101444 states. [2018-12-03 05:19:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101444 to 95861. [2018-12-03 05:19:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95861 states. [2018-12-03 05:19:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95861 states to 95861 states and 302705 transitions. [2018-12-03 05:19:16,195 INFO L78 Accepts]: Start accepts. Automaton has 95861 states and 302705 transitions. Word has length 111 [2018-12-03 05:19:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:16,195 INFO L480 AbstractCegarLoop]: Abstraction has 95861 states and 302705 transitions. [2018-12-03 05:19:16,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:19:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 95861 states and 302705 transitions. [2018-12-03 05:19:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 05:19:16,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:16,305 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:16,305 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:16,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1466740562, now seen corresponding path program 1 times [2018-12-03 05:19:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:16,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:16,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:19:16,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:16,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:16,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:16,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 05:19:16,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:16,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:19:16,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:19:16,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:19:16,421 INFO L87 Difference]: Start difference. First operand 95861 states and 302705 transitions. Second operand 13 states. [2018-12-03 05:19:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:18,471 INFO L93 Difference]: Finished difference Result 162962 states and 511606 transitions. [2018-12-03 05:19:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 05:19:18,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-03 05:19:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:18,669 INFO L225 Difference]: With dead ends: 162962 [2018-12-03 05:19:18,669 INFO L226 Difference]: Without dead ends: 137446 [2018-12-03 05:19:18,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-12-03 05:19:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137446 states. [2018-12-03 05:19:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137446 to 124366. [2018-12-03 05:19:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124366 states. [2018-12-03 05:19:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124366 states to 124366 states and 393294 transitions. [2018-12-03 05:19:20,331 INFO L78 Accepts]: Start accepts. Automaton has 124366 states and 393294 transitions. Word has length 113 [2018-12-03 05:19:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:20,331 INFO L480 AbstractCegarLoop]: Abstraction has 124366 states and 393294 transitions. [2018-12-03 05:19:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:19:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 124366 states and 393294 transitions. [2018-12-03 05:19:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 05:19:20,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:20,481 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:20,481 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:20,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash -361659750, now seen corresponding path program 1 times [2018-12-03 05:19:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:20,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:20,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:20,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 05:19:20,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:20,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 05:19:20,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 05:19:20,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:19:20,574 INFO L87 Difference]: Start difference. First operand 124366 states and 393294 transitions. Second operand 10 states. [2018-12-03 05:19:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:21,653 INFO L93 Difference]: Finished difference Result 179414 states and 567064 transitions. [2018-12-03 05:19:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:19:21,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-03 05:19:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:21,743 INFO L225 Difference]: With dead ends: 179414 [2018-12-03 05:19:21,744 INFO L226 Difference]: Without dead ends: 68750 [2018-12-03 05:19:21,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-03 05:19:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68750 states. [2018-12-03 05:19:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68750 to 68750. [2018-12-03 05:19:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2018-12-03 05:19:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 209398 transitions. [2018-12-03 05:19:22,488 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 209398 transitions. Word has length 113 [2018-12-03 05:19:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:22,488 INFO L480 AbstractCegarLoop]: Abstraction has 68750 states and 209398 transitions. [2018-12-03 05:19:22,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 05:19:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 209398 transitions. [2018-12-03 05:19:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 05:19:22,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:22,557 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:22,557 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:22,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2103993850, now seen corresponding path program 2 times [2018-12-03 05:19:22,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:22,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:22,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 05:19:22,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:22,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 05:19:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 05:19:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:19:22,632 INFO L87 Difference]: Start difference. First operand 68750 states and 209398 transitions. Second operand 10 states. [2018-12-03 05:19:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:23,180 INFO L93 Difference]: Finished difference Result 88816 states and 271595 transitions. [2018-12-03 05:19:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:19:23,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-03 05:19:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:23,202 INFO L225 Difference]: With dead ends: 88816 [2018-12-03 05:19:23,202 INFO L226 Difference]: Without dead ends: 18537 [2018-12-03 05:19:23,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-03 05:19:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18537 states. [2018-12-03 05:19:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18537 to 18535. [2018-12-03 05:19:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18535 states. [2018-12-03 05:19:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18535 states to 18535 states and 58923 transitions. [2018-12-03 05:19:23,390 INFO L78 Accepts]: Start accepts. Automaton has 18535 states and 58923 transitions. Word has length 113 [2018-12-03 05:19:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:23,390 INFO L480 AbstractCegarLoop]: Abstraction has 18535 states and 58923 transitions. [2018-12-03 05:19:23,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 05:19:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 18535 states and 58923 transitions. [2018-12-03 05:19:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 05:19:23,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:23,407 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:23,407 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:23,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1514138485, now seen corresponding path program 1 times [2018-12-03 05:19:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:23,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:19:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:23,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:19:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:19:23,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:19:23,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 05:19:23,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:19:23,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:19:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:19:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:19:23,522 INFO L87 Difference]: Start difference. First operand 18535 states and 58923 transitions. Second operand 13 states. [2018-12-03 05:19:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:19:24,028 INFO L93 Difference]: Finished difference Result 29272 states and 91685 transitions. [2018-12-03 05:19:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 05:19:24,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-03 05:19:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:19:24,051 INFO L225 Difference]: With dead ends: 29272 [2018-12-03 05:19:24,051 INFO L226 Difference]: Without dead ends: 21137 [2018-12-03 05:19:24,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:19:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-12-03 05:19:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 18731. [2018-12-03 05:19:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18731 states. [2018-12-03 05:19:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18731 states to 18731 states and 59264 transitions. [2018-12-03 05:19:24,248 INFO L78 Accepts]: Start accepts. Automaton has 18731 states and 59264 transitions. Word has length 113 [2018-12-03 05:19:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:19:24,248 INFO L480 AbstractCegarLoop]: Abstraction has 18731 states and 59264 transitions. [2018-12-03 05:19:24,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:19:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18731 states and 59264 transitions. [2018-12-03 05:19:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 05:19:24,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:19:24,264 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:19:24,264 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:19:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:19:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1575828745, now seen corresponding path program 2 times [2018-12-03 05:19:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:19:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:19:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:19:24,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:19:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:19:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:19:24,307 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 05:19:24,395 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 05:19:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:19:24 BasicIcfg [2018-12-03 05:19:24,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:19:24,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:19:24,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:19:24,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:19:24,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:48" (3/4) ... [2018-12-03 05:19:24,399 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 05:19:24,499 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9050de04-a729-4983-abe1-16ea527e39fa/bin-2019/utaipan/witness.graphml [2018-12-03 05:19:24,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:19:24,500 INFO L168 Benchmark]: Toolchain (without parser) took 276308.82 ms. Allocated memory was 1.0 GB in the beginning and 9.7 GB in the end (delta: 8.7 GB). Free memory was 948.1 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,501 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:19:24,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,502 INFO L168 Benchmark]: Boogie Preprocessor took 20.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,502 INFO L168 Benchmark]: RCFGBuilder took 389.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,502 INFO L168 Benchmark]: TraceAbstraction took 275429.84 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,502 INFO L168 Benchmark]: Witness Printer took 103.00 ms. Allocated memory is still 9.7 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 97.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. [2018-12-03 05:19:24,504 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275429.84 ms. Allocated memory was 1.1 GB in the beginning and 9.7 GB in the end (delta: 8.6 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. * Witness Printer took 103.00 ms. Allocated memory is still 9.7 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 97.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L816] -1 pthread_t t396; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] FCALL, FORK -1 pthread_create(&t396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] -1 pthread_t t397; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L819] FCALL, FORK -1 pthread_create(&t397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] -1 pthread_t t398; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L821] FCALL, FORK -1 pthread_create(&t398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L776] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L777] 0 z$flush_delayed = weak$$choice2 [L778] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z = z$flush_delayed ? z$mem_tmp : z [L788] 0 z$flush_delayed = (_Bool)0 [L791] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 a = 1 [L717] 1 x = 1 [L720] 1 __unbuffered_p0_EAX = x [L723] 1 __unbuffered_p0_EBX = y [L728] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 2 y = 1 [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 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 [L797] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 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 [L830] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] -1 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 [L834] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 305 locations, 3 error locations. UNSAFE Result, 275.3s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 44.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10758 SDtfs, 13724 SDslu, 31975 SDs, 0 SdLazy, 10274 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 87 SyntacticMatches, 16 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 72.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 644257 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2431 ConstructedInterpolants, 0 QuantifiedInterpolants, 571325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...