./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.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_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/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 f6408090d879aaad1b69ebbc70b7deb9d628b08e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:58,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:07:58,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:07:58,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:07:58,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:07:58,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:07:58,688 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:07:58,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:07:58,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:07:58,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:07:58,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:07:58,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:07:58,691 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:07:58,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:07:58,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:07:58,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:07:58,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:07:58,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:07:58,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:07:58,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:07:58,697 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:07:58,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:07:58,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:07:58,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:07:58,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:07:58,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:07:58,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:07:58,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:07:58,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:07:58,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:07:58,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:07:58,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:07:58,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:07:58,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:07:58,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:07:58,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:07:58,703 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:07:58,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:07:58,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:07:58,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:07:58,711 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:07:58,711 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:07:58,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:07:58,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:07:58,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:07:58,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:07:58,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:07:58,714 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:07:58,714 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_778cebcb-6087-4941-b0da-61d68c861e2d/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 -> f6408090d879aaad1b69ebbc70b7deb9d628b08e [2018-12-03 05:07:58,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:07:58,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:07:58,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:07:58,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:07:58,745 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:07:58,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt_false-unreach-call.i [2018-12-03 05:07:58,791 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/data/ff4f91215/c79e2b09acc1494f92963b257336a0aa/FLAG33f323c91 [2018-12-03 05:07:59,264 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:07:59,264 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/sv-benchmarks/c/pthread-wmm/mix002_rmo.opt_false-unreach-call.i [2018-12-03 05:07:59,272 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/data/ff4f91215/c79e2b09acc1494f92963b257336a0aa/FLAG33f323c91 [2018-12-03 05:07:59,280 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/data/ff4f91215/c79e2b09acc1494f92963b257336a0aa [2018-12-03 05:07:59,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:07:59,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:07:59,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:07:59,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:07:59,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:07:59,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59, skipping insertion in model container [2018-12-03 05:07:59,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:07:59,314 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:07:59,498 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:07:59,506 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:07:59,602 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:07:59,638 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:07:59,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59 WrapperNode [2018-12-03 05:07:59,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:07:59,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:07:59,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:07:59,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:07:59,646 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:07:59" (1/1) ... [2018-12-03 05:07:59,661 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:07:59" (1/1) ... [2018-12-03 05:07:59,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:07:59,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:07:59,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:07:59,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:07:59,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... [2018-12-03 05:07:59,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:07:59,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:07:59,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:07:59,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:07:59,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/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:07:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 05:07:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 05:07:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 05:07:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 05:07:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:07:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:07:59,753 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:08:00,129 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:08:00,129 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 05:08:00,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:00 BoogieIcfgContainer [2018-12-03 05:08:00,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:08:00,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:08:00,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:08:00,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:08:00,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:07:59" (1/3) ... [2018-12-03 05:08:00,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed2faf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:08:00, skipping insertion in model container [2018-12-03 05:08:00,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:07:59" (2/3) ... [2018-12-03 05:08:00,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed2faf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:08:00, skipping insertion in model container [2018-12-03 05:08:00,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:00" (3/3) ... [2018-12-03 05:08:00,134 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002_rmo.opt_false-unreach-call.i [2018-12-03 05:08:00,161 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,167 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,169 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,178 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,178 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,178 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:08:00,179 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:00,203 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 05:08:00,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:08:00,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 05:08:00,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 05:08:00,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:08:00,231 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:08:00,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:08:00,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:08:00,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:08:00,231 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:08:00,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:08:00,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:08:00,238 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191places, 243 transitions [2018-12-03 05:10:10,320 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445148 states. [2018-12-03 05:10:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 445148 states. [2018-12-03 05:10:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 05:10:10,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:10:10,331 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] [2018-12-03 05:10:10,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:10:10,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:10:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash 642654828, now seen corresponding path program 1 times [2018-12-03 05:10:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:10:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:10:10,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:10:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:10:10,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:10:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:10:10,479 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:10:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:10:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:10:10,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:10:10,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:10:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:10:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:10:10,495 INFO L87 Difference]: Start difference. First operand 445148 states. Second operand 4 states. [2018-12-03 05:10:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:10:17,853 INFO L93 Difference]: Finished difference Result 810628 states and 3886645 transitions. [2018-12-03 05:10:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:10:17,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 05:10:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:10:24,370 INFO L225 Difference]: With dead ends: 810628 [2018-12-03 05:10:24,370 INFO L226 Difference]: Without dead ends: 530978 [2018-12-03 05:10:24,371 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:10:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530978 states. [2018-12-03 05:10:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530978 to 307958. [2018-12-03 05:10:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307958 states. [2018-12-03 05:10:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307958 states to 307958 states and 1493659 transitions. [2018-12-03 05:10:48,278 INFO L78 Accepts]: Start accepts. Automaton has 307958 states and 1493659 transitions. Word has length 49 [2018-12-03 05:10:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:10:48,279 INFO L480 AbstractCegarLoop]: Abstraction has 307958 states and 1493659 transitions. [2018-12-03 05:10:48,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:10:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 307958 states and 1493659 transitions. [2018-12-03 05:10:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:10:48,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:10:48,290 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:10:48,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:10:48,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:10:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash -559401747, now seen corresponding path program 1 times [2018-12-03 05:10:48,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:10:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:10:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:10:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:10:48,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:10:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:10:48,340 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:10:48,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:10:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:10:48,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:10:48,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:10:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:10:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:10:48,342 INFO L87 Difference]: Start difference. First operand 307958 states and 1493659 transitions. Second operand 3 states. [2018-12-03 05:10:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:10:50,758 INFO L93 Difference]: Finished difference Result 307958 states and 1492634 transitions. [2018-12-03 05:10:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:10:50,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-03 05:10:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:10:51,686 INFO L225 Difference]: With dead ends: 307958 [2018-12-03 05:10:51,686 INFO L226 Difference]: Without dead ends: 307958 [2018-12-03 05:10:51,686 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:10:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307958 states. [2018-12-03 05:11:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307958 to 307958. [2018-12-03 05:11:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307958 states. [2018-12-03 05:11:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307958 states to 307958 states and 1492634 transitions. [2018-12-03 05:11:06,840 INFO L78 Accepts]: Start accepts. Automaton has 307958 states and 1492634 transitions. Word has length 57 [2018-12-03 05:11:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:06,840 INFO L480 AbstractCegarLoop]: Abstraction has 307958 states and 1492634 transitions. [2018-12-03 05:11:06,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:11:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 307958 states and 1492634 transitions. [2018-12-03 05:11:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:11:06,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:06,847 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:11:06,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1183408588, now seen corresponding path program 1 times [2018-12-03 05:11:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:06,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:06,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:06,889 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:11:06,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:11:06,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:06,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:11:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:11:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:11:06,891 INFO L87 Difference]: Start difference. First operand 307958 states and 1492634 transitions. Second operand 4 states. [2018-12-03 05:11:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:08,753 INFO L93 Difference]: Finished difference Result 272412 states and 1286589 transitions. [2018-12-03 05:11:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:11:08,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-03 05:11:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:09,491 INFO L225 Difference]: With dead ends: 272412 [2018-12-03 05:11:09,491 INFO L226 Difference]: Without dead ends: 258312 [2018-12-03 05:11:09,492 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:11:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258312 states. [2018-12-03 05:11:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258312 to 258312. [2018-12-03 05:11:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258312 states. [2018-12-03 05:11:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258312 states to 258312 states and 1232396 transitions. [2018-12-03 05:11:21,685 INFO L78 Accepts]: Start accepts. Automaton has 258312 states and 1232396 transitions. Word has length 57 [2018-12-03 05:11:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:21,685 INFO L480 AbstractCegarLoop]: Abstraction has 258312 states and 1232396 transitions. [2018-12-03 05:11:21,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:11:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 258312 states and 1232396 transitions. [2018-12-03 05:11:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:11:21,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:21,691 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] [2018-12-03 05:11:21,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1028427502, now seen corresponding path program 1 times [2018-12-03 05:11:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:21,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:21,740 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:11:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:21,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:11:21,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:21,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:11:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:11:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:11:21,741 INFO L87 Difference]: Start difference. First operand 258312 states and 1232396 transitions. Second operand 5 states. [2018-12-03 05:11:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:22,440 INFO L93 Difference]: Finished difference Result 61672 states and 252912 transitions. [2018-12-03 05:11:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:11:22,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-03 05:11:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:22,538 INFO L225 Difference]: With dead ends: 61672 [2018-12-03 05:11:22,538 INFO L226 Difference]: Without dead ends: 49980 [2018-12-03 05:11:22,539 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:11:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49980 states. [2018-12-03 05:11:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49980 to 49520. [2018-12-03 05:11:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49520 states. [2018-12-03 05:11:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49520 states to 49520 states and 199434 transitions. [2018-12-03 05:11:23,266 INFO L78 Accepts]: Start accepts. Automaton has 49520 states and 199434 transitions. Word has length 58 [2018-12-03 05:11:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 49520 states and 199434 transitions. [2018-12-03 05:11:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:11:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 49520 states and 199434 transitions. [2018-12-03 05:11:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:11:23,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:23,269 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] [2018-12-03 05:11:23,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:23,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1388880671, now seen corresponding path program 1 times [2018-12-03 05:11:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:23,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:23,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:23,312 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:11:23,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:11:23,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:23,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:11:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:11:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:11:23,313 INFO L87 Difference]: Start difference. First operand 49520 states and 199434 transitions. Second operand 5 states. [2018-12-03 05:11:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:23,915 INFO L93 Difference]: Finished difference Result 100166 states and 398363 transitions. [2018-12-03 05:11:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:11:23,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-03 05:11:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:24,125 INFO L225 Difference]: With dead ends: 100166 [2018-12-03 05:11:24,125 INFO L226 Difference]: Without dead ends: 99791 [2018-12-03 05:11:24,126 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:11:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99791 states. [2018-12-03 05:11:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99791 to 66559. [2018-12-03 05:11:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66559 states. [2018-12-03 05:11:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66559 states to 66559 states and 261442 transitions. [2018-12-03 05:11:25,640 INFO L78 Accepts]: Start accepts. Automaton has 66559 states and 261442 transitions. Word has length 58 [2018-12-03 05:11:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:25,640 INFO L480 AbstractCegarLoop]: Abstraction has 66559 states and 261442 transitions. [2018-12-03 05:11:25,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:11:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 66559 states and 261442 transitions. [2018-12-03 05:11:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 05:11:25,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:25,644 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] [2018-12-03 05:11:25,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:25,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1403857607, now seen corresponding path program 1 times [2018-12-03 05:11:25,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:25,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:25,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:25,671 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:11:25,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:25,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:11:25,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:25,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:11:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:11:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:11:25,673 INFO L87 Difference]: Start difference. First operand 66559 states and 261442 transitions. Second operand 3 states. [2018-12-03 05:11:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:26,174 INFO L93 Difference]: Finished difference Result 122935 states and 477437 transitions. [2018-12-03 05:11:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:11:26,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 05:11:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:26,435 INFO L225 Difference]: With dead ends: 122935 [2018-12-03 05:11:26,435 INFO L226 Difference]: Without dead ends: 122915 [2018-12-03 05:11:26,435 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:11:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122915 states. [2018-12-03 05:11:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122915 to 103770. [2018-12-03 05:11:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103770 states. [2018-12-03 05:11:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103770 states to 103770 states and 403304 transitions. [2018-12-03 05:11:28,248 INFO L78 Accepts]: Start accepts. Automaton has 103770 states and 403304 transitions. Word has length 60 [2018-12-03 05:11:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:28,249 INFO L480 AbstractCegarLoop]: Abstraction has 103770 states and 403304 transitions. [2018-12-03 05:11:28,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:11:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 103770 states and 403304 transitions. [2018-12-03 05:11:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 05:11:28,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:28,256 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] [2018-12-03 05:11:28,256 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:28,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -151823598, now seen corresponding path program 1 times [2018-12-03 05:11:28,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:28,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:28,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:28,317 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:11:28,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:28,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:11:28,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:28,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:11:28,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:11:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:11:28,318 INFO L87 Difference]: Start difference. First operand 103770 states and 403304 transitions. Second operand 6 states. [2018-12-03 05:11:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:29,362 INFO L93 Difference]: Finished difference Result 144372 states and 554295 transitions. [2018-12-03 05:11:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:11:29,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 05:11:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:29,666 INFO L225 Difference]: With dead ends: 144372 [2018-12-03 05:11:29,667 INFO L226 Difference]: Without dead ends: 143887 [2018-12-03 05:11:29,667 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:11:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143887 states. [2018-12-03 05:11:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143887 to 102871. [2018-12-03 05:11:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102871 states. [2018-12-03 05:11:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102871 states to 102871 states and 400167 transitions. [2018-12-03 05:11:31,691 INFO L78 Accepts]: Start accepts. Automaton has 102871 states and 400167 transitions. Word has length 64 [2018-12-03 05:11:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:31,691 INFO L480 AbstractCegarLoop]: Abstraction has 102871 states and 400167 transitions. [2018-12-03 05:11:31,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:11:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 102871 states and 400167 transitions. [2018-12-03 05:11:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 05:11:31,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:31,717 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] [2018-12-03 05:11:31,717 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:31,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1796953765, now seen corresponding path program 1 times [2018-12-03 05:11:31,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:31,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:31,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:31,774 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:11:31,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:11:31,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:31,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:11:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:11:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:11:31,775 INFO L87 Difference]: Start difference. First operand 102871 states and 400167 transitions. Second operand 6 states. [2018-12-03 05:11:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:33,507 INFO L93 Difference]: Finished difference Result 243645 states and 935212 transitions. [2018-12-03 05:11:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:11:33,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-03 05:11:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:34,043 INFO L225 Difference]: With dead ends: 243645 [2018-12-03 05:11:34,043 INFO L226 Difference]: Without dead ends: 243325 [2018-12-03 05:11:34,044 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:11:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243325 states. [2018-12-03 05:11:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243325 to 150403. [2018-12-03 05:11:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150403 states. [2018-12-03 05:11:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150403 states to 150403 states and 573386 transitions. [2018-12-03 05:11:39,194 INFO L78 Accepts]: Start accepts. Automaton has 150403 states and 573386 transitions. Word has length 75 [2018-12-03 05:11:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:39,195 INFO L480 AbstractCegarLoop]: Abstraction has 150403 states and 573386 transitions. [2018-12-03 05:11:39,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:11:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150403 states and 573386 transitions. [2018-12-03 05:11:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 05:11:39,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:39,250 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:11:39,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:39,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash -456700074, now seen corresponding path program 1 times [2018-12-03 05:11:39,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:39,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:39,280 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:11:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:39,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:11:39,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:39,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:11:39,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:11:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:11:39,281 INFO L87 Difference]: Start difference. First operand 150403 states and 573386 transitions. Second operand 3 states. [2018-12-03 05:11:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:40,154 INFO L93 Difference]: Finished difference Result 174267 states and 657251 transitions. [2018-12-03 05:11:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:11:40,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-03 05:11:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:40,506 INFO L225 Difference]: With dead ends: 174267 [2018-12-03 05:11:40,506 INFO L226 Difference]: Without dead ends: 174267 [2018-12-03 05:11:40,507 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:11:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174267 states. [2018-12-03 05:11:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174267 to 151427. [2018-12-03 05:11:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151427 states. [2018-12-03 05:11:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151427 states to 151427 states and 568101 transitions. [2018-12-03 05:11:43,150 INFO L78 Accepts]: Start accepts. Automaton has 151427 states and 568101 transitions. Word has length 81 [2018-12-03 05:11:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 151427 states and 568101 transitions. [2018-12-03 05:11:43,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:11:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 151427 states and 568101 transitions. [2018-12-03 05:11:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 05:11:43,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:43,203 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] [2018-12-03 05:11:43,203 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:43,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1737112205, now seen corresponding path program 1 times [2018-12-03 05:11:43,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:43,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:43,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:43,296 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:11:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:11:43,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:11:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:11:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:11:43,297 INFO L87 Difference]: Start difference. First operand 151427 states and 568101 transitions. Second operand 7 states. [2018-12-03 05:11:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:44,937 INFO L93 Difference]: Finished difference Result 190331 states and 715356 transitions. [2018-12-03 05:11:44,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:11:44,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-03 05:11:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:45,361 INFO L225 Difference]: With dead ends: 190331 [2018-12-03 05:11:45,361 INFO L226 Difference]: Without dead ends: 190331 [2018-12-03 05:11:45,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:11:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190331 states. [2018-12-03 05:11:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190331 to 176127. [2018-12-03 05:11:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176127 states. [2018-12-03 05:11:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176127 states to 176127 states and 663081 transitions. [2018-12-03 05:11:48,662 INFO L78 Accepts]: Start accepts. Automaton has 176127 states and 663081 transitions. Word has length 82 [2018-12-03 05:11:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:48,662 INFO L480 AbstractCegarLoop]: Abstraction has 176127 states and 663081 transitions. [2018-12-03 05:11:48,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:11:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 176127 states and 663081 transitions. [2018-12-03 05:11:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 05:11:48,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:48,738 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] [2018-12-03 05:11:48,738 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:48,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash 760903732, now seen corresponding path program 1 times [2018-12-03 05:11:48,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:48,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:48,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:48,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:48,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:48,814 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:11:48,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:48,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:11:48,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:11:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:11:48,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:11:48,815 INFO L87 Difference]: Start difference. First operand 176127 states and 663081 transitions. Second operand 8 states. [2018-12-03 05:11:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:50,308 INFO L93 Difference]: Finished difference Result 207867 states and 774684 transitions. [2018-12-03 05:11:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 05:11:50,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-03 05:11:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:50,765 INFO L225 Difference]: With dead ends: 207867 [2018-12-03 05:11:50,765 INFO L226 Difference]: Without dead ends: 207867 [2018-12-03 05:11:50,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:11:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207867 states. [2018-12-03 05:11:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207867 to 185071. [2018-12-03 05:11:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185071 states. [2018-12-03 05:11:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185071 states to 185071 states and 695217 transitions. [2018-12-03 05:11:56,443 INFO L78 Accepts]: Start accepts. Automaton has 185071 states and 695217 transitions. Word has length 82 [2018-12-03 05:11:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:11:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 185071 states and 695217 transitions. [2018-12-03 05:11:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:11:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 185071 states and 695217 transitions. [2018-12-03 05:11:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 05:11:56,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:11:56,518 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] [2018-12-03 05:11:56,518 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:11:56,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:11:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1648407413, now seen corresponding path program 1 times [2018-12-03 05:11:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:11:56,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:11:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:11:56,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:11:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:11:56,566 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:11:56,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:11:56,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:11:56,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:11:56,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:11:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:11:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:11:56,567 INFO L87 Difference]: Start difference. First operand 185071 states and 695217 transitions. Second operand 3 states. [2018-12-03 05:11:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:11:57,447 INFO L93 Difference]: Finished difference Result 153679 states and 567153 transitions. [2018-12-03 05:11:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:11:57,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-03 05:11:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:11:57,738 INFO L225 Difference]: With dead ends: 153679 [2018-12-03 05:11:57,738 INFO L226 Difference]: Without dead ends: 153679 [2018-12-03 05:11:57,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:11:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153679 states. [2018-12-03 05:11:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153679 to 145158. [2018-12-03 05:11:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145158 states. [2018-12-03 05:12:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145158 states to 145158 states and 536251 transitions. [2018-12-03 05:12:00,198 INFO L78 Accepts]: Start accepts. Automaton has 145158 states and 536251 transitions. Word has length 82 [2018-12-03 05:12:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:00,198 INFO L480 AbstractCegarLoop]: Abstraction has 145158 states and 536251 transitions. [2018-12-03 05:12:00,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:12:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 145158 states and 536251 transitions. [2018-12-03 05:12:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 05:12:00,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:00,263 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] [2018-12-03 05:12:00,263 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:00,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1571183429, now seen corresponding path program 1 times [2018-12-03 05:12:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:00,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:00,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:00,309 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:12:00,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:00,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:12:00,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:00,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:12:00,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:12:00,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:12:00,310 INFO L87 Difference]: Start difference. First operand 145158 states and 536251 transitions. Second operand 4 states. [2018-12-03 05:12:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:01,376 INFO L93 Difference]: Finished difference Result 195446 states and 723859 transitions. [2018-12-03 05:12:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:12:01,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-03 05:12:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:02,113 INFO L225 Difference]: With dead ends: 195446 [2018-12-03 05:12:02,113 INFO L226 Difference]: Without dead ends: 192374 [2018-12-03 05:12:02,113 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:12:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192374 states. [2018-12-03 05:12:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192374 to 172678. [2018-12-03 05:12:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172678 states. [2018-12-03 05:12:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172678 states to 172678 states and 640507 transitions. [2018-12-03 05:12:04,904 INFO L78 Accepts]: Start accepts. Automaton has 172678 states and 640507 transitions. Word has length 83 [2018-12-03 05:12:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:04,904 INFO L480 AbstractCegarLoop]: Abstraction has 172678 states and 640507 transitions. [2018-12-03 05:12:04,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:12:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 172678 states and 640507 transitions. [2018-12-03 05:12:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 05:12:04,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:04,976 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] [2018-12-03 05:12:04,976 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -225767930, now seen corresponding path program 1 times [2018-12-03 05:12:04,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:04,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:05,062 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:12:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:05,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:12:05,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:05,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:12:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:12:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:12:05,063 INFO L87 Difference]: Start difference. First operand 172678 states and 640507 transitions. Second operand 8 states. [2018-12-03 05:12:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:06,723 INFO L93 Difference]: Finished difference Result 199835 states and 733923 transitions. [2018-12-03 05:12:06,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:12:06,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-03 05:12:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:07,129 INFO L225 Difference]: With dead ends: 199835 [2018-12-03 05:12:07,129 INFO L226 Difference]: Without dead ends: 199835 [2018-12-03 05:12:07,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:12:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199835 states. [2018-12-03 05:12:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199835 to 183990. [2018-12-03 05:12:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183990 states. [2018-12-03 05:12:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183990 states to 183990 states and 678999 transitions. [2018-12-03 05:12:12,280 INFO L78 Accepts]: Start accepts. Automaton has 183990 states and 678999 transitions. Word has length 83 [2018-12-03 05:12:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:12,280 INFO L480 AbstractCegarLoop]: Abstraction has 183990 states and 678999 transitions. [2018-12-03 05:12:12,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:12:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 183990 states and 678999 transitions. [2018-12-03 05:12:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 05:12:12,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:12,595 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] [2018-12-03 05:12:12,596 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:12,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 661735751, now seen corresponding path program 1 times [2018-12-03 05:12:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:12,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:12,668 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:12:12,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:12,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:12:12,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:12,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:12:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:12:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:12:12,669 INFO L87 Difference]: Start difference. First operand 183990 states and 678999 transitions. Second operand 6 states. [2018-12-03 05:12:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:12,860 INFO L93 Difference]: Finished difference Result 52742 states and 173023 transitions. [2018-12-03 05:12:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:12:12,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-03 05:12:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:12,926 INFO L225 Difference]: With dead ends: 52742 [2018-12-03 05:12:12,926 INFO L226 Difference]: Without dead ends: 46134 [2018-12-03 05:12:12,926 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:12:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46134 states. [2018-12-03 05:12:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46134 to 34594. [2018-12-03 05:12:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34594 states. [2018-12-03 05:12:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34594 states to 34594 states and 113903 transitions. [2018-12-03 05:12:13,427 INFO L78 Accepts]: Start accepts. Automaton has 34594 states and 113903 transitions. Word has length 83 [2018-12-03 05:12:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:13,427 INFO L480 AbstractCegarLoop]: Abstraction has 34594 states and 113903 transitions. [2018-12-03 05:12:13,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:12:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 34594 states and 113903 transitions. [2018-12-03 05:12:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:13,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:13,462 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] [2018-12-03 05:12:13,463 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:13,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash 961232570, now seen corresponding path program 1 times [2018-12-03 05:12:13,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:13,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:13,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:13,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:13,501 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:12:13,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:13,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:12:13,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:13,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:12:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:12:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:12:13,502 INFO L87 Difference]: Start difference. First operand 34594 states and 113903 transitions. Second operand 4 states. [2018-12-03 05:12:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:13,750 INFO L93 Difference]: Finished difference Result 40283 states and 130927 transitions. [2018-12-03 05:12:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:12:13,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-03 05:12:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:13,798 INFO L225 Difference]: With dead ends: 40283 [2018-12-03 05:12:13,798 INFO L226 Difference]: Without dead ends: 40283 [2018-12-03 05:12:13,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:12:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40283 states. [2018-12-03 05:12:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40283 to 37589. [2018-12-03 05:12:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37589 states. [2018-12-03 05:12:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37589 states to 37589 states and 122824 transitions. [2018-12-03 05:12:14,247 INFO L78 Accepts]: Start accepts. Automaton has 37589 states and 122824 transitions. Word has length 112 [2018-12-03 05:12:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:14,247 INFO L480 AbstractCegarLoop]: Abstraction has 37589 states and 122824 transitions. [2018-12-03 05:12:14,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:12:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 37589 states and 122824 transitions. [2018-12-03 05:12:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:14,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:14,286 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] [2018-12-03 05:12:14,286 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:14,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2088970245, now seen corresponding path program 1 times [2018-12-03 05:12:14,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:14,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:14,361 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:12:14,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:12:14,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:14,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:12:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:12:14,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:12:14,362 INFO L87 Difference]: Start difference. First operand 37589 states and 122824 transitions. Second operand 8 states. [2018-12-03 05:12:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:15,577 INFO L93 Difference]: Finished difference Result 83398 states and 263789 transitions. [2018-12-03 05:12:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 05:12:15,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2018-12-03 05:12:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:15,690 INFO L225 Difference]: With dead ends: 83398 [2018-12-03 05:12:15,690 INFO L226 Difference]: Without dead ends: 82983 [2018-12-03 05:12:15,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:12:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82983 states. [2018-12-03 05:12:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82983 to 65864. [2018-12-03 05:12:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65864 states. [2018-12-03 05:12:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65864 states to 65864 states and 212004 transitions. [2018-12-03 05:12:16,649 INFO L78 Accepts]: Start accepts. Automaton has 65864 states and 212004 transitions. Word has length 112 [2018-12-03 05:12:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 65864 states and 212004 transitions. [2018-12-03 05:12:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:12:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65864 states and 212004 transitions. [2018-12-03 05:12:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:16,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:16,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, 1] [2018-12-03 05:12:16,721 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:16,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 128787708, now seen corresponding path program 1 times [2018-12-03 05:12:16,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:16,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:16,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:16,806 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:12:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:12:16,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:16,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:12:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:12:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:12:16,807 INFO L87 Difference]: Start difference. First operand 65864 states and 212004 transitions. Second operand 7 states. [2018-12-03 05:12:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:17,644 INFO L93 Difference]: Finished difference Result 90584 states and 283005 transitions. [2018-12-03 05:12:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:12:17,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-03 05:12:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:17,756 INFO L225 Difference]: With dead ends: 90584 [2018-12-03 05:12:17,756 INFO L226 Difference]: Without dead ends: 90584 [2018-12-03 05:12:17,756 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:12:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90584 states. [2018-12-03 05:12:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90584 to 77369. [2018-12-03 05:12:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77369 states. [2018-12-03 05:12:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77369 states to 77369 states and 244328 transitions. [2018-12-03 05:12:18,826 INFO L78 Accepts]: Start accepts. Automaton has 77369 states and 244328 transitions. Word has length 112 [2018-12-03 05:12:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:18,827 INFO L480 AbstractCegarLoop]: Abstraction has 77369 states and 244328 transitions. [2018-12-03 05:12:18,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:12:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 77369 states and 244328 transitions. [2018-12-03 05:12:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:18,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:18,915 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] [2018-12-03 05:12:18,915 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:18,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 340138621, now seen corresponding path program 1 times [2018-12-03 05:12:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:18,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:18,991 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:12:18,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:18,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:12:18,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:18,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:12:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:12:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:12:18,992 INFO L87 Difference]: Start difference. First operand 77369 states and 244328 transitions. Second operand 7 states. [2018-12-03 05:12:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:19,795 INFO L93 Difference]: Finished difference Result 97917 states and 305281 transitions. [2018-12-03 05:12:19,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 05:12:19,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-03 05:12:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:20,244 INFO L225 Difference]: With dead ends: 97917 [2018-12-03 05:12:20,244 INFO L226 Difference]: Without dead ends: 97917 [2018-12-03 05:12:20,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-12-03 05:12:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97917 states. [2018-12-03 05:12:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97917 to 81516. [2018-12-03 05:12:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81516 states. [2018-12-03 05:12:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81516 states to 81516 states and 256835 transitions. [2018-12-03 05:12:21,319 INFO L78 Accepts]: Start accepts. Automaton has 81516 states and 256835 transitions. Word has length 112 [2018-12-03 05:12:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:21,319 INFO L480 AbstractCegarLoop]: Abstraction has 81516 states and 256835 transitions. [2018-12-03 05:12:21,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:12:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 81516 states and 256835 transitions. [2018-12-03 05:12:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:21,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:21,412 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] [2018-12-03 05:12:21,412 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1967346915, now seen corresponding path program 1 times [2018-12-03 05:12:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:21,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:21,512 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:12:21,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:21,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 05:12:21,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:21,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 05:12:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 05:12:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:12:21,513 INFO L87 Difference]: Start difference. First operand 81516 states and 256835 transitions. Second operand 11 states. [2018-12-03 05:12:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:22,850 INFO L93 Difference]: Finished difference Result 98533 states and 306275 transitions. [2018-12-03 05:12:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 05:12:22,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-12-03 05:12:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:22,977 INFO L225 Difference]: With dead ends: 98533 [2018-12-03 05:12:22,977 INFO L226 Difference]: Without dead ends: 98533 [2018-12-03 05:12:22,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-12-03 05:12:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98533 states. [2018-12-03 05:12:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98533 to 83474. [2018-12-03 05:12:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83474 states. [2018-12-03 05:12:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83474 states to 83474 states and 262697 transitions. [2018-12-03 05:12:24,097 INFO L78 Accepts]: Start accepts. Automaton has 83474 states and 262697 transitions. Word has length 112 [2018-12-03 05:12:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:24,097 INFO L480 AbstractCegarLoop]: Abstraction has 83474 states and 262697 transitions. [2018-12-03 05:12:24,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 05:12:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 83474 states and 262697 transitions. [2018-12-03 05:12:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:24,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:24,193 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] [2018-12-03 05:12:24,193 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:24,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:24,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1079843234, now seen corresponding path program 1 times [2018-12-03 05:12:24,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:24,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:24,224 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:12:24,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:24,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:12:24,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:24,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:12:24,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:12:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:12:24,226 INFO L87 Difference]: Start difference. First operand 83474 states and 262697 transitions. Second operand 3 states. [2018-12-03 05:12:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:24,551 INFO L93 Difference]: Finished difference Result 101714 states and 318884 transitions. [2018-12-03 05:12:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:12:24,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-03 05:12:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:24,696 INFO L225 Difference]: With dead ends: 101714 [2018-12-03 05:12:24,697 INFO L226 Difference]: Without dead ends: 101714 [2018-12-03 05:12:24,697 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:12:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101714 states. [2018-12-03 05:12:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101714 to 101269. [2018-12-03 05:12:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101269 states. [2018-12-03 05:12:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101269 states to 101269 states and 317583 transitions. [2018-12-03 05:12:26,059 INFO L78 Accepts]: Start accepts. Automaton has 101269 states and 317583 transitions. Word has length 112 [2018-12-03 05:12:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:26,059 INFO L480 AbstractCegarLoop]: Abstraction has 101269 states and 317583 transitions. [2018-12-03 05:12:26,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:12:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 101269 states and 317583 transitions. [2018-12-03 05:12:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:26,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:26,184 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] [2018-12-03 05:12:26,185 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:26,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -729043297, now seen corresponding path program 1 times [2018-12-03 05:12:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:26,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:26,261 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:12:26,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:26,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:12:26,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:26,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:12:26,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:12:26,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:12:26,262 INFO L87 Difference]: Start difference. First operand 101269 states and 317583 transitions. Second operand 4 states. [2018-12-03 05:12:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:26,890 INFO L93 Difference]: Finished difference Result 102284 states and 320595 transitions. [2018-12-03 05:12:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:12:26,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-03 05:12:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:27,035 INFO L225 Difference]: With dead ends: 102284 [2018-12-03 05:12:27,035 INFO L226 Difference]: Without dead ends: 102284 [2018-12-03 05:12:27,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:12:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102284 states. [2018-12-03 05:12:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102284 to 97609. [2018-12-03 05:12:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97609 states. [2018-12-03 05:12:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97609 states to 97609 states and 306535 transitions. [2018-12-03 05:12:28,226 INFO L78 Accepts]: Start accepts. Automaton has 97609 states and 306535 transitions. Word has length 112 [2018-12-03 05:12:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:28,227 INFO L480 AbstractCegarLoop]: Abstraction has 97609 states and 306535 transitions. [2018-12-03 05:12:28,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:12:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 97609 states and 306535 transitions. [2018-12-03 05:12:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:28,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:28,342 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] [2018-12-03 05:12:28,343 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:28,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1879700651, now seen corresponding path program 1 times [2018-12-03 05:12:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:28,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:28,383 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:12:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:12:28,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:28,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:12:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:12:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:12:28,384 INFO L87 Difference]: Start difference. First operand 97609 states and 306535 transitions. Second operand 5 states. [2018-12-03 05:12:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:28,890 INFO L93 Difference]: Finished difference Result 110308 states and 342883 transitions. [2018-12-03 05:12:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:12:28,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2018-12-03 05:12:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:29,048 INFO L225 Difference]: With dead ends: 110308 [2018-12-03 05:12:29,048 INFO L226 Difference]: Without dead ends: 110308 [2018-12-03 05:12:29,048 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:12:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110308 states. [2018-12-03 05:12:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110308 to 98744. [2018-12-03 05:12:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98744 states. [2018-12-03 05:12:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98744 states to 98744 states and 309793 transitions. [2018-12-03 05:12:30,449 INFO L78 Accepts]: Start accepts. Automaton has 98744 states and 309793 transitions. Word has length 112 [2018-12-03 05:12:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:30,449 INFO L480 AbstractCegarLoop]: Abstraction has 98744 states and 309793 transitions. [2018-12-03 05:12:30,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:12:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 98744 states and 309793 transitions. [2018-12-03 05:12:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:30,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:30,561 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] [2018-12-03 05:12:30,561 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:30,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1939887497, now seen corresponding path program 2 times [2018-12-03 05:12:30,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:30,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:30,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:30,650 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:12:30,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:12:30,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:30,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:12:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:12:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:12:30,651 INFO L87 Difference]: Start difference. First operand 98744 states and 309793 transitions. Second operand 7 states. [2018-12-03 05:12:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:31,221 INFO L93 Difference]: Finished difference Result 114459 states and 356285 transitions. [2018-12-03 05:12:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:12:31,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-03 05:12:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:31,553 INFO L225 Difference]: With dead ends: 114459 [2018-12-03 05:12:31,553 INFO L226 Difference]: Without dead ends: 113649 [2018-12-03 05:12:31,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:12:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113649 states. [2018-12-03 05:12:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113649 to 92834. [2018-12-03 05:12:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92834 states. [2018-12-03 05:12:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92834 states to 92834 states and 290575 transitions. [2018-12-03 05:12:32,816 INFO L78 Accepts]: Start accepts. Automaton has 92834 states and 290575 transitions. Word has length 112 [2018-12-03 05:12:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:32,817 INFO L480 AbstractCegarLoop]: Abstraction has 92834 states and 290575 transitions. [2018-12-03 05:12:32,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:12:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92834 states and 290575 transitions. [2018-12-03 05:12:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:32,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:32,926 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] [2018-12-03 05:12:32,926 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:32,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1709611304, now seen corresponding path program 1 times [2018-12-03 05:12:32,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:32,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:12:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:32,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:32,964 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:12:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:32,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:12:32,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:32,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:12:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:12:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:12:32,965 INFO L87 Difference]: Start difference. First operand 92834 states and 290575 transitions. Second operand 4 states. [2018-12-03 05:12:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:33,240 INFO L93 Difference]: Finished difference Result 92514 states and 289407 transitions. [2018-12-03 05:12:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:12:33,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-03 05:12:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:33,366 INFO L225 Difference]: With dead ends: 92514 [2018-12-03 05:12:33,367 INFO L226 Difference]: Without dead ends: 92514 [2018-12-03 05:12:33,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:12:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92514 states. [2018-12-03 05:12:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92514 to 86407. [2018-12-03 05:12:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86407 states. [2018-12-03 05:12:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86407 states to 86407 states and 270912 transitions. [2018-12-03 05:12:34,575 INFO L78 Accepts]: Start accepts. Automaton has 86407 states and 270912 transitions. Word has length 112 [2018-12-03 05:12:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:34,576 INFO L480 AbstractCegarLoop]: Abstraction has 86407 states and 270912 transitions. [2018-12-03 05:12:34,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:12:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 86407 states and 270912 transitions. [2018-12-03 05:12:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:34,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:34,674 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] [2018-12-03 05:12:34,674 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 277870456, now seen corresponding path program 1 times [2018-12-03 05:12:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:34,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:34,754 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:12:34,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:34,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:12:34,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:12:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:12:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:12:34,755 INFO L87 Difference]: Start difference. First operand 86407 states and 270912 transitions. Second operand 7 states. [2018-12-03 05:12:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:35,212 INFO L93 Difference]: Finished difference Result 92342 states and 288338 transitions. [2018-12-03 05:12:35,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:12:35,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-03 05:12:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:35,336 INFO L225 Difference]: With dead ends: 92342 [2018-12-03 05:12:35,336 INFO L226 Difference]: Without dead ends: 92342 [2018-12-03 05:12:35,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:12:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92342 states. [2018-12-03 05:12:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92342 to 83572. [2018-12-03 05:12:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83572 states. [2018-12-03 05:12:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83572 states to 83572 states and 262324 transitions. [2018-12-03 05:12:36,507 INFO L78 Accepts]: Start accepts. Automaton has 83572 states and 262324 transitions. Word has length 112 [2018-12-03 05:12:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:36,507 INFO L480 AbstractCegarLoop]: Abstraction has 83572 states and 262324 transitions. [2018-12-03 05:12:36,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:12:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83572 states and 262324 transitions. [2018-12-03 05:12:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 05:12:36,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:36,608 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] [2018-12-03 05:12:36,608 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:36,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1165374137, now seen corresponding path program 2 times [2018-12-03 05:12:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:36,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:36,684 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:12:36,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:12:36,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:36,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:12:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:12:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:12:36,685 INFO L87 Difference]: Start difference. First operand 83572 states and 262324 transitions. Second operand 6 states. [2018-12-03 05:12:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:37,315 INFO L93 Difference]: Finished difference Result 99595 states and 311219 transitions. [2018-12-03 05:12:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:12:37,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-12-03 05:12:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:37,459 INFO L225 Difference]: With dead ends: 99595 [2018-12-03 05:12:37,459 INFO L226 Difference]: Without dead ends: 99595 [2018-12-03 05:12:37,459 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:12:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99595 states. [2018-12-03 05:12:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99595 to 83532. [2018-12-03 05:12:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83532 states. [2018-12-03 05:12:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83532 states to 83532 states and 261862 transitions. [2018-12-03 05:12:38,807 INFO L78 Accepts]: Start accepts. Automaton has 83532 states and 261862 transitions. Word has length 112 [2018-12-03 05:12:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:38,807 INFO L480 AbstractCegarLoop]: Abstraction has 83532 states and 261862 transitions. [2018-12-03 05:12:38,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:12:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 83532 states and 261862 transitions. [2018-12-03 05:12:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 05:12:38,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:38,896 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, 1] [2018-12-03 05:12:38,896 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:38,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash 232845242, now seen corresponding path program 1 times [2018-12-03 05:12:38,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:38,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:12:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:38,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:39,011 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:12:39,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:39,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 05:12:39,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:39,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:12:39,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:12:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:12:39,011 INFO L87 Difference]: Start difference. First operand 83532 states and 261862 transitions. Second operand 13 states. [2018-12-03 05:12:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:40,333 INFO L93 Difference]: Finished difference Result 132398 states and 410541 transitions. [2018-12-03 05:12:40,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 05:12:40,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2018-12-03 05:12:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:40,510 INFO L225 Difference]: With dead ends: 132398 [2018-12-03 05:12:40,510 INFO L226 Difference]: Without dead ends: 122886 [2018-12-03 05:12:40,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2018-12-03 05:12:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122886 states. [2018-12-03 05:12:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122886 to 99477. [2018-12-03 05:12:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99477 states. [2018-12-03 05:12:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99477 states to 99477 states and 311398 transitions. [2018-12-03 05:12:42,266 INFO L78 Accepts]: Start accepts. Automaton has 99477 states and 311398 transitions. Word has length 114 [2018-12-03 05:12:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:42,266 INFO L480 AbstractCegarLoop]: Abstraction has 99477 states and 311398 transitions. [2018-12-03 05:12:42,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:12:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 99477 states and 311398 transitions. [2018-12-03 05:12:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 05:12:42,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:42,388 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, 1] [2018-12-03 05:12:42,388 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:42,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1914396793, now seen corresponding path program 1 times [2018-12-03 05:12:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:42,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:42,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:42,477 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:12:42,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:42,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 05:12:42,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:42,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 05:12:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 05:12:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:12:42,478 INFO L87 Difference]: Start difference. First operand 99477 states and 311398 transitions. Second operand 10 states. [2018-12-03 05:12:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:43,281 INFO L93 Difference]: Finished difference Result 142337 states and 444907 transitions. [2018-12-03 05:12:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:12:43,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-03 05:12:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:43,352 INFO L225 Difference]: With dead ends: 142337 [2018-12-03 05:12:43,353 INFO L226 Difference]: Without dead ends: 52169 [2018-12-03 05:12:43,353 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:12:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52169 states. [2018-12-03 05:12:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52169 to 52169. [2018-12-03 05:12:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52169 states. [2018-12-03 05:12:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52169 states to 52169 states and 155522 transitions. [2018-12-03 05:12:43,947 INFO L78 Accepts]: Start accepts. Automaton has 52169 states and 155522 transitions. Word has length 114 [2018-12-03 05:12:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:43,947 INFO L480 AbstractCegarLoop]: Abstraction has 52169 states and 155522 transitions. [2018-12-03 05:12:43,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 05:12:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 52169 states and 155522 transitions. [2018-12-03 05:12:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 05:12:44,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:44,000 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, 1] [2018-12-03 05:12:44,000 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:44,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 286764009, now seen corresponding path program 2 times [2018-12-03 05:12:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:44,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:12:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:44,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:44,085 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:12:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 05:12:44,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 05:12:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 05:12:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:12:44,086 INFO L87 Difference]: Start difference. First operand 52169 states and 155522 transitions. Second operand 10 states. [2018-12-03 05:12:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:44,614 INFO L93 Difference]: Finished difference Result 67574 states and 202237 transitions. [2018-12-03 05:12:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:12:44,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-03 05:12:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:44,632 INFO L225 Difference]: With dead ends: 67574 [2018-12-03 05:12:44,632 INFO L226 Difference]: Without dead ends: 13665 [2018-12-03 05:12:44,632 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:12:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13665 states. [2018-12-03 05:12:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13665 to 13663. [2018-12-03 05:12:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13663 states. [2018-12-03 05:12:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 42834 transitions. [2018-12-03 05:12:44,773 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 42834 transitions. Word has length 114 [2018-12-03 05:12:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:44,774 INFO L480 AbstractCegarLoop]: Abstraction has 13663 states and 42834 transitions. [2018-12-03 05:12:44,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 05:12:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 42834 transitions. [2018-12-03 05:12:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 05:12:44,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:44,787 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, 1] [2018-12-03 05:12:44,787 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:44,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash -643420003, now seen corresponding path program 3 times [2018-12-03 05:12:44,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:44,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:12:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:44,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:12:44,974 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:12:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:12:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 05:12:44,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:12:44,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:12:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:12:44,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:12:44,975 INFO L87 Difference]: Start difference. First operand 13663 states and 42834 transitions. Second operand 13 states. [2018-12-03 05:12:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:12:45,468 INFO L93 Difference]: Finished difference Result 22580 states and 69592 transitions. [2018-12-03 05:12:45,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 05:12:45,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2018-12-03 05:12:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:12:45,486 INFO L225 Difference]: With dead ends: 22580 [2018-12-03 05:12:45,486 INFO L226 Difference]: Without dead ends: 16026 [2018-12-03 05:12:45,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:12:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16026 states. [2018-12-03 05:12:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16026 to 13868. [2018-12-03 05:12:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13868 states. [2018-12-03 05:12:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13868 states to 13868 states and 43208 transitions. [2018-12-03 05:12:45,642 INFO L78 Accepts]: Start accepts. Automaton has 13868 states and 43208 transitions. Word has length 114 [2018-12-03 05:12:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:12:45,642 INFO L480 AbstractCegarLoop]: Abstraction has 13868 states and 43208 transitions. [2018-12-03 05:12:45,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:12:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 13868 states and 43208 transitions. [2018-12-03 05:12:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 05:12:45,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:12:45,656 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, 1] [2018-12-03 05:12:45,657 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:12:45,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:12:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash 48191279, now seen corresponding path program 4 times [2018-12-03 05:12:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:12:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:45,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:12:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:12:45,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:12:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:12:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:12:45,714 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 05:12:45,831 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 05:12:45,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:12:45 BasicIcfg [2018-12-03 05:12:45,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:12:45,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:12:45,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:12:45,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:12:45,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:00" (3/4) ... [2018-12-03 05:12:45,835 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 05:12:45,955 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_778cebcb-6087-4941-b0da-61d68c861e2d/bin-2019/utaipan/witness.graphml [2018-12-03 05:12:45,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:12:45,956 INFO L168 Benchmark]: Toolchain (without parser) took 286673.16 ms. Allocated memory was 1.0 GB in the beginning and 9.5 GB in the end (delta: 8.4 GB). Free memory was 948.1 MB in the beginning and 5.9 GB in the end (delta: -4.9 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,956 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.75 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: RCFGBuilder took 412.23 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: TraceAbstraction took 285702.45 ms. Allocated memory was 1.1 GB in the beginning and 9.5 GB in the end (delta: 8.3 GB). Free memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: -4.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,957 INFO L168 Benchmark]: Witness Printer took 122.63 ms. Allocated memory is still 9.5 GB. Free memory was 6.0 GB in the beginning and 5.9 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:12:45,958 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.75 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.23 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 285702.45 ms. Allocated memory was 1.1 GB in the beginning and 9.5 GB in the end (delta: 8.3 GB). Free memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: -4.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 122.63 ms. Allocated memory is still 9.5 GB. Free memory was 6.0 GB in the beginning and 5.9 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 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_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L684] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L686] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L821] -1 pthread_t t55; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L822] FCALL, FORK -1 pthread_create(&t55, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L823] -1 pthread_t t56; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L824] FCALL, FORK -1 pthread_create(&t56, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L825] -1 pthread_t t57; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L826] FCALL, FORK -1 pthread_create(&t57, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L768] 0 z$w_buff1 = z$w_buff0 [L769] 0 z$w_buff0 = 1 [L770] 0 z$w_buff1_used = z$w_buff0_used [L771] 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_p1_EBX=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] [L773] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L774] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L775] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L776] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L777] 0 z$r_buff0_thd3 = (_Bool)1 [L780] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L781] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L782] 0 z$flush_delayed = weak$$choice2 [L783] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L784] 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_p1_EBX=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] [L784] 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_p1_EBX=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] [L784] 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_p1_EBX=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] [L784] 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) [L785] 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_p1_EBX=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$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)) [L786] 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_p1_EBX=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] [L786] 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)) [L787] 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_p1_EBX=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] [L787] 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)) [L788] 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_p1_EBX=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] [L788] 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)) [L789] 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_p1_EBX=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] [L789] 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)) [L790] 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_p1_EBX=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] [L790] 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)) [L791] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L792] 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_p1_EBX=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] [L792] 0 z = z$flush_delayed ? z$mem_tmp : z [L793] 0 z$flush_delayed = (_Bool)0 [L796] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L799] 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_p1_EBX=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] [L716] 1 a = 1 [L719] 1 x = 1 [L722] 1 __unbuffered_p0_EAX = x [L725] 1 __unbuffered_p0_EBX = y [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L737] 2 y = 1 [L740] 2 __unbuffered_p1_EAX = y [L743] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L744] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L745] 2 z$flush_delayed = weak$$choice2 [L746] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L747] 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=1, __unbuffered_p1_EBX=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] [L747] 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) [L748] 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=1, __unbuffered_p1_EBX=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] [L748] 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)) [L749] 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=1, __unbuffered_p1_EBX=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] [L749] 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)) [L750] 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=1, __unbuffered_p1_EBX=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] [L750] 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)) [L751] 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=1, __unbuffered_p1_EBX=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] [L751] 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)) [L752] 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=1, __unbuffered_p1_EBX=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] [L752] 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)) [L753] 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=1, __unbuffered_p1_EBX=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] [L753] 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)) [L754] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L755] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L799] 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) [L800] 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=1, __unbuffered_p1_EBX=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] [L800] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 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 [L802] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L803] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 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 [L806] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 z = z$flush_delayed ? z$mem_tmp : z [L756] 2 z$flush_delayed = (_Bool)0 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L828] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L832] 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=1, __unbuffered_p1_EBX=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] [L832] 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=1, __unbuffered_p1_EBX=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] [L832] 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=1, __unbuffered_p1_EBX=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] [L832] -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) [L833] 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=1, __unbuffered_p1_EBX=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] [L833] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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=1, __unbuffered_p1_EBX=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] [L834] -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 [L835] 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=1, __unbuffered_p1_EBX=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] [L835] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L836] 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=1, __unbuffered_p1_EBX=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] [L836] -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 [L839] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, __unbuffered_p1_EBX=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=1, __unbuffered_p1_EBX=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, 306 locations, 3 error locations. UNSAFE Result, 285.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 49.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12562 SDtfs, 16347 SDslu, 38053 SDs, 0 SdLazy, 13191 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 83 SyntacticMatches, 24 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445148occurred 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: 101.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 683733 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2968 NumberOfCodeBlocks, 2968 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2823 ConstructedInterpolants, 0 QuantifiedInterpolants, 688139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...