./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_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_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/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 bc28bb760373a1c30fb22cb571f76934eae5a007 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-02 08:42:54,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:42:54,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:42:54,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:42:54,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:42:54,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:42:54,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:42:54,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:42:54,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:42:54,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:42:54,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:42:54,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:42:54,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:42:54,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:42:54,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:42:54,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:42:54,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:42:54,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:42:54,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:42:54,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:42:54,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:42:54,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:42:54,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:42:54,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:42:54,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:42:54,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:42:54,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:42:54,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:42:54,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:42:54,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:42:54,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:42:54,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:42:54,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:42:54,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:42:54,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:42:54,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:42:54,470 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 08:42:54,478 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:42:54,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:42:54,478 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:42:54,478 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:42:54,479 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:42:54,479 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:42:54,480 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:42:54,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:42:54,480 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:42:54,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:42:54,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:42:54,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:42:54,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:42:54,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:42:54,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:42:54,482 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:42:54,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:42:54,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 08:42:54,483 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_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/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 -> bc28bb760373a1c30fb22cb571f76934eae5a007 [2018-12-02 08:42:54,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:42:54,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:42:54,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:42:54,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:42:54,515 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:42:54,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-02 08:42:54,556 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/data/5ade0884b/041dbfc0271247a2bacc21c4ba23fc23/FLAGc87c01572 [2018-12-02 08:42:54,981 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:42:54,982 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-02 08:42:54,990 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/data/5ade0884b/041dbfc0271247a2bacc21c4ba23fc23/FLAGc87c01572 [2018-12-02 08:42:54,998 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/data/5ade0884b/041dbfc0271247a2bacc21c4ba23fc23 [2018-12-02 08:42:55,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:42:55,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:42:55,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:42:55,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:42:55,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:42:55,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:54" (1/1) ... [2018-12-02 08:42:55,005 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 02.12 08:42:55, skipping insertion in model container [2018-12-02 08:42:55,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:54" (1/1) ... [2018-12-02 08:42:55,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:42:55,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:42:55,213 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:42:55,221 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:42:55,296 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:42:55,325 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:42:55,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55 WrapperNode [2018-12-02 08:42:55,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:42:55,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:42:55,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:42:55,327 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:42:55,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:42:55,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:42:55,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:42:55,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:42:55,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... [2018-12-02 08:42:55,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:42:55,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:42:55,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:42:55,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:42:55,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/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-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 08:42:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 08:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 08:42:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 08:42:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 08:42:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 08:42:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 08:42:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:42:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:42:55,420 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 08:42:55,787 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:42:55,787 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:42:55,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:55 BoogieIcfgContainer [2018-12-02 08:42:55,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:42:55,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:42:55,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:42:55,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:42:55,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:42:54" (1/3) ... [2018-12-02 08:42:55,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c595c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:42:55, skipping insertion in model container [2018-12-02 08:42:55,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:55" (2/3) ... [2018-12-02 08:42:55,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c595c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:42:55, skipping insertion in model container [2018-12-02 08:42:55,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:55" (3/3) ... [2018-12-02 08:42:55,792 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_rmo.opt_false-unreach-call.i [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,820 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,829 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,833 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:42:55,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 08:42:55,847 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:42:55,854 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 08:42:55,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 08:42:55,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:42:55,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:42:55,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:42:55,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:42:55,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:42:55,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:42:55,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:42:55,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:42:55,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189places, 241 transitions [2018-12-02 08:45:16,739 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445146 states. [2018-12-02 08:45:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 445146 states. [2018-12-02 08:45:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 08:45:16,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:45:16,748 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] [2018-12-02 08:45:16,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:45:16,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:45:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1446185373, now seen corresponding path program 1 times [2018-12-02 08:45:16,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:45:16,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:16,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:45:16,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:16,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:45:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:45:16,899 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-02 08:45:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:45:16,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:45:16,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:45:16,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:45:16,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:45:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:45:16,913 INFO L87 Difference]: Start difference. First operand 445146 states. Second operand 4 states. [2018-12-02 08:45:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:45:21,363 INFO L93 Difference]: Finished difference Result 810626 states and 3886643 transitions. [2018-12-02 08:45:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:45:21,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 08:45:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:45:28,263 INFO L225 Difference]: With dead ends: 810626 [2018-12-02 08:45:28,263 INFO L226 Difference]: Without dead ends: 530976 [2018-12-02 08:45:28,265 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-02 08:45:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530976 states. [2018-12-02 08:45:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530976 to 307956. [2018-12-02 08:45:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-02 08:45:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1493657 transitions. [2018-12-02 08:45:42,041 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1493657 transitions. Word has length 47 [2018-12-02 08:45:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:45:42,042 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1493657 transitions. [2018-12-02 08:45:42,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:45:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1493657 transitions. [2018-12-02 08:45:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 08:45:42,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:45:42,051 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] [2018-12-02 08:45:42,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:45:42,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:45:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1064613016, now seen corresponding path program 1 times [2018-12-02 08:45:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:45:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:42,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:45:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:42,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:45:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:45:42,109 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-02 08:45:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:45:42,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:45:42,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:45:42,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:45:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:45:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:45:42,111 INFO L87 Difference]: Start difference. First operand 307956 states and 1493657 transitions. Second operand 4 states. [2018-12-02 08:45:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:45:44,160 INFO L93 Difference]: Finished difference Result 272410 states and 1287431 transitions. [2018-12-02 08:45:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:45:44,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 08:45:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:45:44,905 INFO L225 Difference]: With dead ends: 272410 [2018-12-02 08:45:44,905 INFO L226 Difference]: Without dead ends: 258310 [2018-12-02 08:45:44,906 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-02 08:45:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258310 states. [2018-12-02 08:45:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258310 to 258310. [2018-12-02 08:45:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258310 states. [2018-12-02 08:45:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258310 states to 258310 states and 1233238 transitions. [2018-12-02 08:45:57,616 INFO L78 Accepts]: Start accepts. Automaton has 258310 states and 1233238 transitions. Word has length 55 [2018-12-02 08:45:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:45:57,616 INFO L480 AbstractCegarLoop]: Abstraction has 258310 states and 1233238 transitions. [2018-12-02 08:45:57,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:45:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 258310 states and 1233238 transitions. [2018-12-02 08:45:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 08:45:57,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:45:57,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:45:57,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:45:57,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:45:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1750301674, now seen corresponding path program 1 times [2018-12-02 08:45:57,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:45:57,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:45:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:57,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:45:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:45:57,692 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-02 08:45:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:45:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:45:57,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:45:57,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:45:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:45:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:45:57,693 INFO L87 Difference]: Start difference. First operand 258310 states and 1233238 transitions. Second operand 5 states. [2018-12-02 08:45:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:45:57,943 INFO L93 Difference]: Finished difference Result 61670 states and 253006 transitions. [2018-12-02 08:45:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:45:57,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 08:45:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:45:58,064 INFO L225 Difference]: With dead ends: 61670 [2018-12-02 08:45:58,064 INFO L226 Difference]: Without dead ends: 49978 [2018-12-02 08:45:58,065 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-02 08:45:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2018-12-02 08:45:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49518. [2018-12-02 08:45:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49518 states. [2018-12-02 08:45:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49518 states to 49518 states and 199528 transitions. [2018-12-02 08:45:58,762 INFO L78 Accepts]: Start accepts. Automaton has 49518 states and 199528 transitions. Word has length 56 [2018-12-02 08:45:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:45:58,763 INFO L480 AbstractCegarLoop]: Abstraction has 49518 states and 199528 transitions. [2018-12-02 08:45:58,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:45:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49518 states and 199528 transitions. [2018-12-02 08:45:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 08:45:58,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:45:58,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:45:58,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:45:58,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:45:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2065306486, now seen corresponding path program 1 times [2018-12-02 08:45:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:45:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:45:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:45:58,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:45:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:45:58,798 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-02 08:45:58,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:45:58,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:45:58,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:45:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:45:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:45:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:45:58,799 INFO L87 Difference]: Start difference. First operand 49518 states and 199528 transitions. Second operand 5 states. [2018-12-02 08:45:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:45:59,826 INFO L93 Difference]: Finished difference Result 100164 states and 398537 transitions. [2018-12-02 08:45:59,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:45:59,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 08:45:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:00,028 INFO L225 Difference]: With dead ends: 100164 [2018-12-02 08:46:00,028 INFO L226 Difference]: Without dead ends: 99789 [2018-12-02 08:46:00,028 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-02 08:46:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99789 states. [2018-12-02 08:46:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99789 to 66557. [2018-12-02 08:46:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66557 states. [2018-12-02 08:46:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66557 states to 66557 states and 261584 transitions. [2018-12-02 08:46:01,146 INFO L78 Accepts]: Start accepts. Automaton has 66557 states and 261584 transitions. Word has length 56 [2018-12-02 08:46:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:01,146 INFO L480 AbstractCegarLoop]: Abstraction has 66557 states and 261584 transitions. [2018-12-02 08:46:01,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:46:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 66557 states and 261584 transitions. [2018-12-02 08:46:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 08:46:01,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:01,149 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-02 08:46:01,149 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:01,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash 397938288, now seen corresponding path program 1 times [2018-12-02 08:46:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:01,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:01,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:01,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:01,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:01,171 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-02 08:46:01,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:46:01,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:46:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:46:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:46:01,172 INFO L87 Difference]: Start difference. First operand 66557 states and 261584 transitions. Second operand 3 states. [2018-12-02 08:46:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:03,254 INFO L93 Difference]: Finished difference Result 122933 states and 477675 transitions. [2018-12-02 08:46:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:46:03,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-02 08:46:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:03,509 INFO L225 Difference]: With dead ends: 122933 [2018-12-02 08:46:03,510 INFO L226 Difference]: Without dead ends: 122913 [2018-12-02 08:46:03,510 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-02 08:46:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122913 states. [2018-12-02 08:46:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122913 to 103768. [2018-12-02 08:46:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2018-12-02 08:46:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 403446 transitions. [2018-12-02 08:46:05,241 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 403446 transitions. Word has length 58 [2018-12-02 08:46:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:05,242 INFO L480 AbstractCegarLoop]: Abstraction has 103768 states and 403446 transitions. [2018-12-02 08:46:05,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:46:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 403446 transitions. [2018-12-02 08:46:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 08:46:05,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:05,248 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] [2018-12-02 08:46:05,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:05,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash -549306821, now seen corresponding path program 1 times [2018-12-02 08:46:05,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:05,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:05,328 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-02 08:46:05,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:05,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:46:05,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:05,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:46:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:46:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:46:05,329 INFO L87 Difference]: Start difference. First operand 103768 states and 403446 transitions. Second operand 8 states. [2018-12-02 08:46:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:06,518 INFO L93 Difference]: Finished difference Result 140478 states and 532789 transitions. [2018-12-02 08:46:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:46:06,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-02 08:46:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:06,807 INFO L225 Difference]: With dead ends: 140478 [2018-12-02 08:46:06,807 INFO L226 Difference]: Without dead ends: 140013 [2018-12-02 08:46:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-02 08:46:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140013 states. [2018-12-02 08:46:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140013 to 105817. [2018-12-02 08:46:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105817 states. [2018-12-02 08:46:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105817 states to 105817 states and 410167 transitions. [2018-12-02 08:46:08,704 INFO L78 Accepts]: Start accepts. Automaton has 105817 states and 410167 transitions. Word has length 62 [2018-12-02 08:46:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:08,705 INFO L480 AbstractCegarLoop]: Abstraction has 105817 states and 410167 transitions. [2018-12-02 08:46:08,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:46:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105817 states and 410167 transitions. [2018-12-02 08:46:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 08:46:08,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:08,729 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] [2018-12-02 08:46:08,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:08,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash 74113855, now seen corresponding path program 1 times [2018-12-02 08:46:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:08,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:08,767 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-02 08:46:08,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:08,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:46:08,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:46:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:46:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:46:08,769 INFO L87 Difference]: Start difference. First operand 105817 states and 410167 transitions. Second operand 4 states. [2018-12-02 08:46:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:09,555 INFO L93 Difference]: Finished difference Result 134671 states and 525470 transitions. [2018-12-02 08:46:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:46:09,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-02 08:46:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:09,837 INFO L225 Difference]: With dead ends: 134671 [2018-12-02 08:46:09,837 INFO L226 Difference]: Without dead ends: 134671 [2018-12-02 08:46:09,838 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-02 08:46:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134671 states. [2018-12-02 08:46:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134671 to 122063. [2018-12-02 08:46:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122063 states. [2018-12-02 08:46:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122063 states to 122063 states and 473790 transitions. [2018-12-02 08:46:11,974 INFO L78 Accepts]: Start accepts. Automaton has 122063 states and 473790 transitions. Word has length 73 [2018-12-02 08:46:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:11,974 INFO L480 AbstractCegarLoop]: Abstraction has 122063 states and 473790 transitions. [2018-12-02 08:46:11,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:46:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122063 states and 473790 transitions. [2018-12-02 08:46:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 08:46:12,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:12,004 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] [2018-12-02 08:46:12,004 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:12,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1816924190, now seen corresponding path program 1 times [2018-12-02 08:46:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:12,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:12,048 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-02 08:46:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:46:12,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:12,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:46:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:46:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:46:12,048 INFO L87 Difference]: Start difference. First operand 122063 states and 473790 transitions. Second operand 6 states. [2018-12-02 08:46:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:12,255 INFO L93 Difference]: Finished difference Result 51087 states and 174606 transitions. [2018-12-02 08:46:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:46:12,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 08:46:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:12,325 INFO L225 Difference]: With dead ends: 51087 [2018-12-02 08:46:12,325 INFO L226 Difference]: Without dead ends: 44303 [2018-12-02 08:46:12,325 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-02 08:46:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2018-12-02 08:46:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 38118. [2018-12-02 08:46:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38118 states. [2018-12-02 08:46:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38118 states to 38118 states and 128492 transitions. [2018-12-02 08:46:12,809 INFO L78 Accepts]: Start accepts. Automaton has 38118 states and 128492 transitions. Word has length 73 [2018-12-02 08:46:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:12,809 INFO L480 AbstractCegarLoop]: Abstraction has 38118 states and 128492 transitions. [2018-12-02 08:46:12,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:46:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 38118 states and 128492 transitions. [2018-12-02 08:46:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 08:46:12,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 08:46:12,847 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1298061300, now seen corresponding path program 1 times [2018-12-02 08:46:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:12,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:12,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:12,891 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-02 08:46:12,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:12,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:46:12,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:12,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:46:12,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:46:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:46:12,892 INFO L87 Difference]: Start difference. First operand 38118 states and 128492 transitions. Second operand 4 states. [2018-12-02 08:46:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:13,119 INFO L93 Difference]: Finished difference Result 44328 states and 147355 transitions. [2018-12-02 08:46:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:46:13,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 08:46:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:13,177 INFO L225 Difference]: With dead ends: 44328 [2018-12-02 08:46:13,177 INFO L226 Difference]: Without dead ends: 44328 [2018-12-02 08:46:13,177 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-02 08:46:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44328 states. [2018-12-02 08:46:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44328 to 41995. [2018-12-02 08:46:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41995 states. [2018-12-02 08:46:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41995 states to 41995 states and 140228 transitions. [2018-12-02 08:46:13,755 INFO L78 Accepts]: Start accepts. Automaton has 41995 states and 140228 transitions. Word has length 108 [2018-12-02 08:46:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:13,755 INFO L480 AbstractCegarLoop]: Abstraction has 41995 states and 140228 transitions. [2018-12-02 08:46:13,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:46:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41995 states and 140228 transitions. [2018-12-02 08:46:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 08:46:13,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:13,795 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] [2018-12-02 08:46:13,795 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:13,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 919696653, now seen corresponding path program 1 times [2018-12-02 08:46:13,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:13,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:13,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:13,826 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-02 08:46:13,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:13,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:46:13,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:13,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:46:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:46:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:46:13,827 INFO L87 Difference]: Start difference. First operand 41995 states and 140228 transitions. Second operand 3 states. [2018-12-02 08:46:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:14,105 INFO L93 Difference]: Finished difference Result 57485 states and 189945 transitions. [2018-12-02 08:46:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:46:14,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-02 08:46:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:14,187 INFO L225 Difference]: With dead ends: 57485 [2018-12-02 08:46:14,187 INFO L226 Difference]: Without dead ends: 57485 [2018-12-02 08:46:14,188 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-02 08:46:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57485 states. [2018-12-02 08:46:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57485 to 51445. [2018-12-02 08:46:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51445 states. [2018-12-02 08:46:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51445 states to 51445 states and 171388 transitions. [2018-12-02 08:46:14,842 INFO L78 Accepts]: Start accepts. Automaton has 51445 states and 171388 transitions. Word has length 108 [2018-12-02 08:46:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:14,842 INFO L480 AbstractCegarLoop]: Abstraction has 51445 states and 171388 transitions. [2018-12-02 08:46:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:46:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 51445 states and 171388 transitions. [2018-12-02 08:46:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 08:46:14,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:14,898 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] [2018-12-02 08:46:14,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:14,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1110537687, now seen corresponding path program 2 times [2018-12-02 08:46:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:14,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:14,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:14,969 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-02 08:46:14,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:14,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:46:14,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:14,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:46:14,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:46:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:46:14,970 INFO L87 Difference]: Start difference. First operand 51445 states and 171388 transitions. Second operand 5 states. [2018-12-02 08:46:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:15,454 INFO L93 Difference]: Finished difference Result 65127 states and 212743 transitions. [2018-12-02 08:46:15,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:46:15,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-02 08:46:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:15,538 INFO L225 Difference]: With dead ends: 65127 [2018-12-02 08:46:15,538 INFO L226 Difference]: Without dead ends: 65127 [2018-12-02 08:46:15,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:46:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65127 states. [2018-12-02 08:46:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65127 to 55880. [2018-12-02 08:46:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55880 states. [2018-12-02 08:46:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55880 states to 55880 states and 184886 transitions. [2018-12-02 08:46:16,256 INFO L78 Accepts]: Start accepts. Automaton has 55880 states and 184886 transitions. Word has length 108 [2018-12-02 08:46:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:16,256 INFO L480 AbstractCegarLoop]: Abstraction has 55880 states and 184886 transitions. [2018-12-02 08:46:16,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:46:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 55880 states and 184886 transitions. [2018-12-02 08:46:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 08:46:16,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:16,315 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] [2018-12-02 08:46:16,316 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:16,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash -411744613, now seen corresponding path program 3 times [2018-12-02 08:46:16,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:16,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:16,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:16,363 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-02 08:46:16,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:16,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:46:16,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:16,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:46:16,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:46:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:46:16,365 INFO L87 Difference]: Start difference. First operand 55880 states and 184886 transitions. Second operand 4 states. [2018-12-02 08:46:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:16,598 INFO L93 Difference]: Finished difference Result 56712 states and 187654 transitions. [2018-12-02 08:46:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:46:16,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 08:46:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:16,678 INFO L225 Difference]: With dead ends: 56712 [2018-12-02 08:46:16,678 INFO L226 Difference]: Without dead ends: 56712 [2018-12-02 08:46:16,678 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-02 08:46:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56712 states. [2018-12-02 08:46:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56712 to 56136. [2018-12-02 08:46:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56136 states. [2018-12-02 08:46:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56136 states to 56136 states and 185782 transitions. [2018-12-02 08:46:17,415 INFO L78 Accepts]: Start accepts. Automaton has 56136 states and 185782 transitions. Word has length 108 [2018-12-02 08:46:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:17,415 INFO L480 AbstractCegarLoop]: Abstraction has 56136 states and 185782 transitions. [2018-12-02 08:46:17,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:46:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 56136 states and 185782 transitions. [2018-12-02 08:46:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 08:46:17,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:17,476 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] [2018-12-02 08:46:17,476 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:17,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:17,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2075768220, now seen corresponding path program 1 times [2018-12-02 08:46:17,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:17,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:17,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:17,564 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-02 08:46:17,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:17,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:46:17,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:17,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:46:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:46:17,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:46:17,566 INFO L87 Difference]: Start difference. First operand 56136 states and 185782 transitions. Second operand 6 states. [2018-12-02 08:46:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:17,738 INFO L93 Difference]: Finished difference Result 55944 states and 184646 transitions. [2018-12-02 08:46:17,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:46:17,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-02 08:46:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:17,817 INFO L225 Difference]: With dead ends: 55944 [2018-12-02 08:46:17,817 INFO L226 Difference]: Without dead ends: 55944 [2018-12-02 08:46:17,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:46:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55944 states. [2018-12-02 08:46:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55944 to 52207. [2018-12-02 08:46:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52207 states. [2018-12-02 08:46:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52207 states to 52207 states and 173146 transitions. [2018-12-02 08:46:18,508 INFO L78 Accepts]: Start accepts. Automaton has 52207 states and 173146 transitions. Word has length 108 [2018-12-02 08:46:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:18,508 INFO L480 AbstractCegarLoop]: Abstraction has 52207 states and 173146 transitions. [2018-12-02 08:46:18,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:46:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 52207 states and 173146 transitions. [2018-12-02 08:46:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:18,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:18,567 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] [2018-12-02 08:46:18,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:18,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1888864614, now seen corresponding path program 1 times [2018-12-02 08:46:18,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:18,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:18,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:18,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:18,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:18,624 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-02 08:46:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:18,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:46:18,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:46:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:46:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:46:18,625 INFO L87 Difference]: Start difference. First operand 52207 states and 173146 transitions. Second operand 8 states. [2018-12-02 08:46:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:19,838 INFO L93 Difference]: Finished difference Result 99910 states and 325515 transitions. [2018-12-02 08:46:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 08:46:19,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-02 08:46:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:19,996 INFO L225 Difference]: With dead ends: 99910 [2018-12-02 08:46:19,996 INFO L226 Difference]: Without dead ends: 99455 [2018-12-02 08:46:19,996 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-02 08:46:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99455 states. [2018-12-02 08:46:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99455 to 74582. [2018-12-02 08:46:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74582 states. [2018-12-02 08:46:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74582 states to 74582 states and 247121 transitions. [2018-12-02 08:46:21,055 INFO L78 Accepts]: Start accepts. Automaton has 74582 states and 247121 transitions. Word has length 110 [2018-12-02 08:46:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:21,055 INFO L480 AbstractCegarLoop]: Abstraction has 74582 states and 247121 transitions. [2018-12-02 08:46:21,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:46:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 74582 states and 247121 transitions. [2018-12-02 08:46:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:21,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:21,141 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] [2018-12-02 08:46:21,142 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:21,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash 328893339, now seen corresponding path program 1 times [2018-12-02 08:46:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:21,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:21,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:21,222 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-02 08:46:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:46:21,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:21,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:46:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:46:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:46:21,223 INFO L87 Difference]: Start difference. First operand 74582 states and 247121 transitions. Second operand 7 states. [2018-12-02 08:46:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:22,032 INFO L93 Difference]: Finished difference Result 116727 states and 374727 transitions. [2018-12-02 08:46:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:46:22,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-02 08:46:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:22,215 INFO L225 Difference]: With dead ends: 116727 [2018-12-02 08:46:22,215 INFO L226 Difference]: Without dead ends: 116727 [2018-12-02 08:46:22,215 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-02 08:46:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116727 states. [2018-12-02 08:46:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116727 to 94602. [2018-12-02 08:46:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94602 states. [2018-12-02 08:46:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94602 states to 94602 states and 308197 transitions. [2018-12-02 08:46:23,556 INFO L78 Accepts]: Start accepts. Automaton has 94602 states and 308197 transitions. Word has length 110 [2018-12-02 08:46:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:23,556 INFO L480 AbstractCegarLoop]: Abstraction has 94602 states and 308197 transitions. [2018-12-02 08:46:23,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:46:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 94602 states and 308197 transitions. [2018-12-02 08:46:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:23,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:23,832 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] [2018-12-02 08:46:23,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:23,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash 540244252, now seen corresponding path program 1 times [2018-12-02 08:46:23,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:23,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:23,908 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-02 08:46:23,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:23,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:46:23,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:23,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:46:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:46:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:46:23,909 INFO L87 Difference]: Start difference. First operand 94602 states and 308197 transitions. Second operand 7 states. [2018-12-02 08:46:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:24,424 INFO L93 Difference]: Finished difference Result 98264 states and 319154 transitions. [2018-12-02 08:46:24,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:46:24,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-02 08:46:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:24,572 INFO L225 Difference]: With dead ends: 98264 [2018-12-02 08:46:24,573 INFO L226 Difference]: Without dead ends: 98264 [2018-12-02 08:46:24,573 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-02 08:46:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98264 states. [2018-12-02 08:46:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98264 to 97455. [2018-12-02 08:46:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97455 states. [2018-12-02 08:46:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97455 states to 97455 states and 316905 transitions. [2018-12-02 08:46:26,026 INFO L78 Accepts]: Start accepts. Automaton has 97455 states and 316905 transitions. Word has length 110 [2018-12-02 08:46:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:26,026 INFO L480 AbstractCegarLoop]: Abstraction has 97455 states and 316905 transitions. [2018-12-02 08:46:26,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:46:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 97455 states and 316905 transitions. [2018-12-02 08:46:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:26,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:26,140 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] [2018-12-02 08:46:26,140 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:26,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1427747933, now seen corresponding path program 1 times [2018-12-02 08:46:26,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:26,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:26,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:26,186 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-02 08:46:26,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:26,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:46:26,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:26,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:46:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:46:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:46:26,187 INFO L87 Difference]: Start difference. First operand 97455 states and 316905 transitions. Second operand 4 states. [2018-12-02 08:46:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:26,757 INFO L93 Difference]: Finished difference Result 128678 states and 420430 transitions. [2018-12-02 08:46:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:46:26,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-02 08:46:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:26,967 INFO L225 Difference]: With dead ends: 128678 [2018-12-02 08:46:26,967 INFO L226 Difference]: Without dead ends: 128678 [2018-12-02 08:46:26,968 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-02 08:46:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128678 states. [2018-12-02 08:46:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128678 to 93800. [2018-12-02 08:46:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93800 states. [2018-12-02 08:46:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93800 states to 93800 states and 305171 transitions. [2018-12-02 08:46:28,487 INFO L78 Accepts]: Start accepts. Automaton has 93800 states and 305171 transitions. Word has length 110 [2018-12-02 08:46:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:28,487 INFO L480 AbstractCegarLoop]: Abstraction has 93800 states and 305171 transitions. [2018-12-02 08:46:28,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:46:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 93800 states and 305171 transitions. [2018-12-02 08:46:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:28,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:28,596 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] [2018-12-02 08:46:28,596 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:28,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -637899201, now seen corresponding path program 2 times [2018-12-02 08:46:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:28,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:28,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:28,640 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-02 08:46:28,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:28,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:46:28,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:28,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:46:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:46:28,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:46:28,641 INFO L87 Difference]: Start difference. First operand 93800 states and 305171 transitions. Second operand 5 states. [2018-12-02 08:46:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:29,117 INFO L93 Difference]: Finished difference Result 103018 states and 332542 transitions. [2018-12-02 08:46:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:46:29,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-02 08:46:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:29,283 INFO L225 Difference]: With dead ends: 103018 [2018-12-02 08:46:29,283 INFO L226 Difference]: Without dead ends: 103018 [2018-12-02 08:46:29,283 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-02 08:46:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103018 states. [2018-12-02 08:46:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103018 to 96815. [2018-12-02 08:46:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96815 states. [2018-12-02 08:46:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96815 states to 96815 states and 314243 transitions. [2018-12-02 08:46:30,646 INFO L78 Accepts]: Start accepts. Automaton has 96815 states and 314243 transitions. Word has length 110 [2018-12-02 08:46:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:30,646 INFO L480 AbstractCegarLoop]: Abstraction has 96815 states and 314243 transitions. [2018-12-02 08:46:30,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:46:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 96815 states and 314243 transitions. [2018-12-02 08:46:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:30,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:30,760 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] [2018-12-02 08:46:30,760 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:30,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1032658435, now seen corresponding path program 3 times [2018-12-02 08:46:30,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:30,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:30,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:30,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:30,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:30,785 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-02 08:46:30,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:30,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:46:30,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:30,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:46:30,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:46:30,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:46:30,786 INFO L87 Difference]: Start difference. First operand 96815 states and 314243 transitions. Second operand 3 states. [2018-12-02 08:46:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:31,153 INFO L93 Difference]: Finished difference Result 116755 states and 378120 transitions. [2018-12-02 08:46:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:46:31,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-02 08:46:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:31,343 INFO L225 Difference]: With dead ends: 116755 [2018-12-02 08:46:31,343 INFO L226 Difference]: Without dead ends: 116755 [2018-12-02 08:46:31,343 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-02 08:46:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116755 states. [2018-12-02 08:46:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116755 to 116350. [2018-12-02 08:46:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116350 states. [2018-12-02 08:46:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116350 states to 116350 states and 376936 transitions. [2018-12-02 08:46:32,890 INFO L78 Accepts]: Start accepts. Automaton has 116350 states and 376936 transitions. Word has length 110 [2018-12-02 08:46:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:32,890 INFO L480 AbstractCegarLoop]: Abstraction has 116350 states and 376936 transitions. [2018-12-02 08:46:32,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:46:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 116350 states and 376936 transitions. [2018-12-02 08:46:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 08:46:33,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:33,038 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] [2018-12-02 08:46:33,038 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:33,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1244009348, now seen corresponding path program 1 times [2018-12-02 08:46:33,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:33,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:33,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:33,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:33,098 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-02 08:46:33,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:33,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:46:33,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:33,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:46:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:46:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:46:33,099 INFO L87 Difference]: Start difference. First operand 116350 states and 376936 transitions. Second operand 6 states. [2018-12-02 08:46:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:33,847 INFO L93 Difference]: Finished difference Result 137108 states and 443419 transitions. [2018-12-02 08:46:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:46:33,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-02 08:46:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:34,057 INFO L225 Difference]: With dead ends: 137108 [2018-12-02 08:46:34,057 INFO L226 Difference]: Without dead ends: 137108 [2018-12-02 08:46:34,057 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-02 08:46:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137108 states. [2018-12-02 08:46:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137108 to 116525. [2018-12-02 08:46:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116525 states. [2018-12-02 08:46:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116525 states to 116525 states and 377451 transitions. [2018-12-02 08:46:35,779 INFO L78 Accepts]: Start accepts. Automaton has 116525 states and 377451 transitions. Word has length 110 [2018-12-02 08:46:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:35,779 INFO L480 AbstractCegarLoop]: Abstraction has 116525 states and 377451 transitions. [2018-12-02 08:46:35,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:46:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 116525 states and 377451 transitions. [2018-12-02 08:46:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 08:46:35,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:35,928 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-02 08:46:35,928 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:35,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:35,928 INFO L82 PathProgramCache]: Analyzing trace with hash 312737698, now seen corresponding path program 1 times [2018-12-02 08:46:35,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:35,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:35,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:35,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:35,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:36,035 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-02 08:46:36,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:36,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 08:46:36,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:36,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 08:46:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 08:46:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:46:36,036 INFO L87 Difference]: Start difference. First operand 116525 states and 377451 transitions. Second operand 10 states. [2018-12-02 08:46:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:37,117 INFO L93 Difference]: Finished difference Result 171629 states and 553403 transitions. [2018-12-02 08:46:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:46:37,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-12-02 08:46:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:37,210 INFO L225 Difference]: With dead ends: 171629 [2018-12-02 08:46:37,210 INFO L226 Difference]: Without dead ends: 66869 [2018-12-02 08:46:37,210 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-02 08:46:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66869 states. [2018-12-02 08:46:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66869 to 66869. [2018-12-02 08:46:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66869 states. [2018-12-02 08:46:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66869 states to 66869 states and 207759 transitions. [2018-12-02 08:46:37,929 INFO L78 Accepts]: Start accepts. Automaton has 66869 states and 207759 transitions. Word has length 112 [2018-12-02 08:46:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:37,929 INFO L480 AbstractCegarLoop]: Abstraction has 66869 states and 207759 transitions. [2018-12-02 08:46:37,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 08:46:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 66869 states and 207759 transitions. [2018-12-02 08:46:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 08:46:37,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:37,998 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-02 08:46:37,998 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 207315942, now seen corresponding path program 2 times [2018-12-02 08:46:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:37,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:38,064 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-02 08:46:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:46:38,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:46:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:46:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:46:38,065 INFO L87 Difference]: Start difference. First operand 66869 states and 207759 transitions. Second operand 7 states. [2018-12-02 08:46:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:38,514 INFO L93 Difference]: Finished difference Result 84255 states and 263472 transitions. [2018-12-02 08:46:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:46:38,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-02 08:46:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:38,535 INFO L225 Difference]: With dead ends: 84255 [2018-12-02 08:46:38,535 INFO L226 Difference]: Without dead ends: 17031 [2018-12-02 08:46:38,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:46:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17031 states. [2018-12-02 08:46:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17031 to 17029. [2018-12-02 08:46:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17029 states. [2018-12-02 08:46:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 55039 transitions. [2018-12-02 08:46:38,706 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 55039 transitions. Word has length 112 [2018-12-02 08:46:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:38,707 INFO L480 AbstractCegarLoop]: Abstraction has 17029 states and 55039 transitions. [2018-12-02 08:46:38,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:46:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 55039 transitions. [2018-12-02 08:46:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 08:46:38,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:38,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-02 08:46:38,722 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:38,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 816097090, now seen corresponding path program 1 times [2018-12-02 08:46:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:38,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:38,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:38,802 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-02 08:46:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:38,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 08:46:38,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:46:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:46:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:46:38,803 INFO L87 Difference]: Start difference. First operand 17029 states and 55039 transitions. Second operand 11 states. [2018-12-02 08:46:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:39,253 INFO L93 Difference]: Finished difference Result 23024 states and 73119 transitions. [2018-12-02 08:46:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:46:39,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-12-02 08:46:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:39,279 INFO L225 Difference]: With dead ends: 23024 [2018-12-02 08:46:39,280 INFO L226 Difference]: Without dead ends: 23024 [2018-12-02 08:46:39,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-02 08:46:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23024 states. [2018-12-02 08:46:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23024 to 16907. [2018-12-02 08:46:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16907 states. [2018-12-02 08:46:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16907 states to 16907 states and 54681 transitions. [2018-12-02 08:46:39,477 INFO L78 Accepts]: Start accepts. Automaton has 16907 states and 54681 transitions. Word has length 112 [2018-12-02 08:46:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:39,477 INFO L480 AbstractCegarLoop]: Abstraction has 16907 states and 54681 transitions. [2018-12-02 08:46:39,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:46:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 54681 transitions. [2018-12-02 08:46:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 08:46:39,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:39,491 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-02 08:46:39,491 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:39,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1129786526, now seen corresponding path program 3 times [2018-12-02 08:46:39,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:39,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:46:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:39,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:46:39,595 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-02 08:46:39,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:46:39,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 08:46:39,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:46:39,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 08:46:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 08:46:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 08:46:39,596 INFO L87 Difference]: Start difference. First operand 16907 states and 54681 transitions. Second operand 13 states. [2018-12-02 08:46:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:46:40,101 INFO L93 Difference]: Finished difference Result 26916 states and 85550 transitions. [2018-12-02 08:46:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:46:40,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-12-02 08:46:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:46:40,124 INFO L225 Difference]: With dead ends: 26916 [2018-12-02 08:46:40,124 INFO L226 Difference]: Without dead ends: 20138 [2018-12-02 08:46:40,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-02 08:46:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2018-12-02 08:46:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 17254. [2018-12-02 08:46:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-02 08:46:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 55530 transitions. [2018-12-02 08:46:40,310 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 55530 transitions. Word has length 112 [2018-12-02 08:46:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:46:40,310 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 55530 transitions. [2018-12-02 08:46:40,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 08:46:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 55530 transitions. [2018-12-02 08:46:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 08:46:40,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:46:40,325 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-02 08:46:40,325 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:46:40,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:46:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1172321924, now seen corresponding path program 4 times [2018-12-02 08:46:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:46:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:40,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:46:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:46:40,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:46:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:46:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:46:40,367 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:46:40,451 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 08:46:40,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:46:40 BasicIcfg [2018-12-02 08:46:40,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:46:40,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:46:40,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:46:40,453 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:46:40,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:55" (3/4) ... [2018-12-02 08:46:40,455 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:46:40,539 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d01a7d20-7d5c-4e32-87ed-7e26297c5bc5/bin-2019/utaipan/witness.graphml [2018-12-02 08:46:40,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:46:40,539 INFO L168 Benchmark]: Toolchain (without parser) took 225539.27 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.1 GB). Free memory was 958.0 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,540 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:46:40,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,541 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:46:40,541 INFO L168 Benchmark]: RCFGBuilder took 405.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,541 INFO L168 Benchmark]: TraceAbstraction took 224664.76 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,541 INFO L168 Benchmark]: Witness Printer took 86.15 ms. Allocated memory is still 7.1 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:46:40,542 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 224664.76 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 86.15 ms. Allocated memory is still 7.1 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=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] [L686] -1 int x = 0; VAL [__unbuffered_cnt=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] [L688] -1 int y = 0; VAL [__unbuffered_cnt=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] [L690] -1 int z = 0; VAL [__unbuffered_cnt=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] [L691] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=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] [L692] -1 int z$mem_tmp; VAL [__unbuffered_cnt=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] [L693] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L694] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L696] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L697] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L698] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L699] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L700] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L701] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=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] [L702] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=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}] [L703] -1 int z$w_buff0; VAL [__unbuffered_cnt=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] [L704] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=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] [L705] -1 int z$w_buff1; VAL [__unbuffered_cnt=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] [L706] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=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] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L814] -1 pthread_t t298; VAL [__unbuffered_cnt=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] [L815] FCALL, FORK -1 pthread_create(&t298, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L816] -1 pthread_t t299; VAL [__unbuffered_cnt=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] [L817] FCALL, FORK -1 pthread_create(&t299, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L818] -1 pthread_t t300; VAL [__unbuffered_cnt=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] [L819] FCALL, FORK -1 pthread_create(&t300, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L761] 0 z$w_buff1 = z$w_buff0 [L762] 0 z$w_buff0 = 1 [L763] 0 z$w_buff1_used = z$w_buff0_used [L764] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L766] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L767] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L768] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L769] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L770] 0 z$r_buff0_thd3 = (_Bool)1 [L773] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L774] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L775] 0 z$flush_delayed = weak$$choice2 [L776] 0 z$mem_tmp = z VAL [__unbuffered_cnt=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] [L777] 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_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] [L777] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=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] [L777] 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_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] [L777] 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) [L778] 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_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] [L778] 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)) [L779] 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_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] [L779] 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)) [L780] 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_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] [L780] 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)) [L781] 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_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] [L781] 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)) [L782] 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_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] [L782] 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)) [L783] 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_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] [L783] 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)) [L784] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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] [L785] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=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] [L785] 0 z = z$flush_delayed ? z$mem_tmp : z [L786] 0 z$flush_delayed = (_Bool)0 [L789] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=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] [L792] 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_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] [L712] 1 a = 1 [L715] 1 x = 1 [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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] [L727] 2 x = 2 [L730] 2 y = 1 [L733] 2 __unbuffered_p1_EAX = y [L736] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L737] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L738] 2 z$flush_delayed = weak$$choice2 [L739] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L740] 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_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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L793] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used 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_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=2, y=1, 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] [L793] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L794] 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 [!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_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=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 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) [L741] 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_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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L741] 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)) [L742] 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_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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L742] 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)) [L743] 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_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))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L743] 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)) [L744] 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_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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L794] 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 [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L795] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L796] 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_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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$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 [L799] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L744] 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)) [L745] 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=2, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L745] 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)) [L746] 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=2, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L746] 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)) [L747] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L748] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z = z$flush_delayed ? z$mem_tmp : z [L749] 2 z$flush_delayed = (_Bool)0 [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L821] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L825] 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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L825] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L825] 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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L825] -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) [L826] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L826] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] 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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z$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 [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] 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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$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 [L832] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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, 304 locations, 3 error locations. UNSAFE Result, 224.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 31.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8624 SDtfs, 10068 SDslu, 22628 SDs, 0 SdLazy, 7406 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 64 SyntacticMatches, 22 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445146occurred 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: 49.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 469658 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2350 NumberOfCodeBlocks, 2350 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 494789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...