./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/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 340d44e6d272edde8a4a60d91a9d70b9dcde31ef ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 10:50:01,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:50:01,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:50:01,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:50:01,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:50:01,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:50:01,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:50:01,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:50:01,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:50:01,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:50:01,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:50:01,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:50:01,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:50:01,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:50:01,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:50:01,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:50:01,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:50:01,593 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:50:01,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:50:01,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:50:01,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:50:01,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:50:01,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:50:01,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:50:01,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:50:01,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:50:01,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:50:01,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:50:01,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:50:01,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:50:01,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:50:01,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:50:01,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:50:01,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:50:01,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:50:01,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:50:01,602 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:50:01,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:50:01,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:50:01,610 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:50:01,610 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:50:01,610 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:50:01,610 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:50:01,610 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:50:01,611 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:50:01,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:50:01,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:50:01,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:50:01,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:50:01,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:50:01,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:50:01,615 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_a0c9c768-87f0-437d-b479-e02cce9c9d4a/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 -> 340d44e6d272edde8a4a60d91a9d70b9dcde31ef [2018-12-09 10:50:01,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:50:01,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:50:01,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:50:01,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:50:01,646 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:50:01,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2018-12-09 10:50:01,686 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/data/ba804d19f/424865c900a649d8a042d5a89a3da139/FLAG4f78e691f [2018-12-09 10:50:02,057 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:50:02,058 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/sv-benchmarks/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2018-12-09 10:50:02,065 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/data/ba804d19f/424865c900a649d8a042d5a89a3da139/FLAG4f78e691f [2018-12-09 10:50:02,073 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/data/ba804d19f/424865c900a649d8a042d5a89a3da139 [2018-12-09 10:50:02,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:50:02,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:50:02,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:50:02,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:50:02,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:50:02,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02, skipping insertion in model container [2018-12-09 10:50:02,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:50:02,113 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:50:02,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:50:02,297 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:50:02,379 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:50:02,415 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:50:02,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02 WrapperNode [2018-12-09 10:50:02,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:50:02,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:50:02,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:50:02,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:50:02,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:50:02,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:50:02,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:50:02,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:50:02,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... [2018-12-09 10:50:02,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:50:02,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:50:02,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:50:02,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:50:02,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/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-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:50:02,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:50:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:50:02,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:50:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:50:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:50:02,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:50:02,509 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 10:50:02,788 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:50:02,788 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:50:02,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:50:02 BoogieIcfgContainer [2018-12-09 10:50:02,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:50:02,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:50:02,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:50:02,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:50:02,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:50:02" (1/3) ... [2018-12-09 10:50:02,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2293a652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:50:02, skipping insertion in model container [2018-12-09 10:50:02,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:50:02" (2/3) ... [2018-12-09 10:50:02,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2293a652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:50:02, skipping insertion in model container [2018-12-09 10:50:02,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:50:02" (3/3) ... [2018-12-09 10:50:02,793 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt_false-unreach-call.i [2018-12-09 10:50:02,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,816 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:50:02,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:50:02,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:50:02,841 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:50:02,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:50:02,867 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:50:02,867 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:50:02,867 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:50:02,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:50:02,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:50:02,867 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:50:02,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:50:02,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:50:02,874 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134places, 166 transitions [2018-12-09 10:50:04,094 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2018-12-09 10:50:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2018-12-09 10:50:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 10:50:04,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:04,101 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] [2018-12-09 10:50:04,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:04,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1858856236, now seen corresponding path program 1 times [2018-12-09 10:50:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:04,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:04,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:04,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:04,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:04,252 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-09 10:50:04,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:04,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:50:04,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:04,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:50:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:50:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:50:04,266 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2018-12-09 10:50:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:04,661 INFO L93 Difference]: Finished difference Result 47770 states and 183121 transitions. [2018-12-09 10:50:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:50:04,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-09 10:50:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:04,793 INFO L225 Difference]: With dead ends: 47770 [2018-12-09 10:50:04,794 INFO L226 Difference]: Without dead ends: 34610 [2018-12-09 10:50:04,795 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-09 10:50:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34610 states. [2018-12-09 10:50:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34610 to 21758. [2018-12-09 10:50:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2018-12-09 10:50:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2018-12-09 10:50:05,471 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2018-12-09 10:50:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:05,472 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2018-12-09 10:50:05,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:50:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2018-12-09 10:50:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 10:50:05,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:05,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:50:05,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:05,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1910881222, now seen corresponding path program 1 times [2018-12-09 10:50:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:05,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:05,526 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-09 10:50:05,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:05,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:50:05,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:05,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:50:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:50:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:50:05,527 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 4 states. [2018-12-09 10:50:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:05,579 INFO L93 Difference]: Finished difference Result 7172 states and 23628 transitions. [2018-12-09 10:50:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:50:05,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 10:50:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:05,592 INFO L225 Difference]: With dead ends: 7172 [2018-12-09 10:50:05,593 INFO L226 Difference]: Without dead ends: 6326 [2018-12-09 10:50:05,593 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-09 10:50:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2018-12-09 10:50:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2018-12-09 10:50:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2018-12-09 10:50:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 20700 transitions. [2018-12-09 10:50:05,667 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 20700 transitions. Word has length 49 [2018-12-09 10:50:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:05,668 INFO L480 AbstractCegarLoop]: Abstraction has 6326 states and 20700 transitions. [2018-12-09 10:50:05,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:50:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 20700 transitions. [2018-12-09 10:50:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 10:50:05,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:05,669 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] [2018-12-09 10:50:05,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:05,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1649618541, now seen corresponding path program 1 times [2018-12-09 10:50:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:05,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:05,724 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-09 10:50:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:05,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:50:05,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:05,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:50:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:50:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:50:05,726 INFO L87 Difference]: Start difference. First operand 6326 states and 20700 transitions. Second operand 5 states. [2018-12-09 10:50:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:05,993 INFO L93 Difference]: Finished difference Result 12022 states and 38786 transitions. [2018-12-09 10:50:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:50:05,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 10:50:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:06,026 INFO L225 Difference]: With dead ends: 12022 [2018-12-09 10:50:06,026 INFO L226 Difference]: Without dead ends: 11947 [2018-12-09 10:50:06,026 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-09 10:50:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2018-12-09 10:50:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 8291. [2018-12-09 10:50:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-12-09 10:50:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 26553 transitions. [2018-12-09 10:50:06,161 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 26553 transitions. Word has length 50 [2018-12-09 10:50:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:06,162 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 26553 transitions. [2018-12-09 10:50:06,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:50:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 26553 transitions. [2018-12-09 10:50:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 10:50:06,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:06,163 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] [2018-12-09 10:50:06,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1323058643, now seen corresponding path program 1 times [2018-12-09 10:50:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:06,196 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-09 10:50:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:06,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:50:06,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:50:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:50:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:50:06,197 INFO L87 Difference]: Start difference. First operand 8291 states and 26553 transitions. Second operand 3 states. [2018-12-09 10:50:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:06,241 INFO L93 Difference]: Finished difference Result 10987 states and 34708 transitions. [2018-12-09 10:50:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:50:06,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 10:50:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:06,253 INFO L225 Difference]: With dead ends: 10987 [2018-12-09 10:50:06,253 INFO L226 Difference]: Without dead ends: 10983 [2018-12-09 10:50:06,254 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-09 10:50:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2018-12-09 10:50:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8509. [2018-12-09 10:50:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2018-12-09 10:50:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 26989 transitions. [2018-12-09 10:50:06,347 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 26989 transitions. Word has length 52 [2018-12-09 10:50:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:06,348 INFO L480 AbstractCegarLoop]: Abstraction has 8509 states and 26989 transitions. [2018-12-09 10:50:06,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:50:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 26989 transitions. [2018-12-09 10:50:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 10:50:06,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:06,349 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-09 10:50:06,349 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:06,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash -260685666, now seen corresponding path program 1 times [2018-12-09 10:50:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:06,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:06,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:06,393 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-09 10:50:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:06,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:06,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:06,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:06,393 INFO L87 Difference]: Start difference. First operand 8509 states and 26989 transitions. Second operand 6 states. [2018-12-09 10:50:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:06,637 INFO L93 Difference]: Finished difference Result 11925 states and 37200 transitions. [2018-12-09 10:50:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:50:06,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 10:50:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:06,650 INFO L225 Difference]: With dead ends: 11925 [2018-12-09 10:50:06,650 INFO L226 Difference]: Without dead ends: 11828 [2018-12-09 10:50:06,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:50:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2018-12-09 10:50:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9283. [2018-12-09 10:50:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9283 states. [2018-12-09 10:50:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 29433 transitions. [2018-12-09 10:50:06,752 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 29433 transitions. Word has length 56 [2018-12-09 10:50:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:06,752 INFO L480 AbstractCegarLoop]: Abstraction has 9283 states and 29433 transitions. [2018-12-09 10:50:06,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 29433 transitions. [2018-12-09 10:50:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 10:50:06,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:06,757 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] [2018-12-09 10:50:06,757 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:06,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -257711961, now seen corresponding path program 1 times [2018-12-09 10:50:06,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:06,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:06,792 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-09 10:50:06,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:50:06,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:06,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:50:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:50:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:50:06,793 INFO L87 Difference]: Start difference. First operand 9283 states and 29433 transitions. Second operand 4 states. [2018-12-09 10:50:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:06,937 INFO L93 Difference]: Finished difference Result 10902 states and 34384 transitions. [2018-12-09 10:50:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:50:06,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 10:50:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:06,950 INFO L225 Difference]: With dead ends: 10902 [2018-12-09 10:50:06,950 INFO L226 Difference]: Without dead ends: 10902 [2018-12-09 10:50:06,950 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-09 10:50:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2018-12-09 10:50:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 9934. [2018-12-09 10:50:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9934 states. [2018-12-09 10:50:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9934 states to 9934 states and 31410 transitions. [2018-12-09 10:50:07,050 INFO L78 Accepts]: Start accepts. Automaton has 9934 states and 31410 transitions. Word has length 66 [2018-12-09 10:50:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:07,050 INFO L480 AbstractCegarLoop]: Abstraction has 9934 states and 31410 transitions. [2018-12-09 10:50:07,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:50:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9934 states and 31410 transitions. [2018-12-09 10:50:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 10:50:07,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:07,054 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] [2018-12-09 10:50:07,055 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:07,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1485098374, now seen corresponding path program 1 times [2018-12-09 10:50:07,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:07,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:07,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:07,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:07,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:07,111 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-09 10:50:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:07,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:07,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:07,112 INFO L87 Difference]: Start difference. First operand 9934 states and 31410 transitions. Second operand 6 states. [2018-12-09 10:50:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:07,412 INFO L93 Difference]: Finished difference Result 21765 states and 67782 transitions. [2018-12-09 10:50:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:50:07,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 10:50:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:07,434 INFO L225 Difference]: With dead ends: 21765 [2018-12-09 10:50:07,434 INFO L226 Difference]: Without dead ends: 21701 [2018-12-09 10:50:07,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:50:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21701 states. [2018-12-09 10:50:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21701 to 13159. [2018-12-09 10:50:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2018-12-09 10:50:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 40991 transitions. [2018-12-09 10:50:07,607 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 40991 transitions. Word has length 66 [2018-12-09 10:50:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:07,607 INFO L480 AbstractCegarLoop]: Abstraction has 13159 states and 40991 transitions. [2018-12-09 10:50:07,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 40991 transitions. [2018-12-09 10:50:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 10:50:07,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:07,613 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] [2018-12-09 10:50:07,613 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:07,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -52804182, now seen corresponding path program 1 times [2018-12-09 10:50:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:07,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:07,654 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-09 10:50:07,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:07,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:50:07,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:07,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:50:07,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:50:07,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:50:07,655 INFO L87 Difference]: Start difference. First operand 13159 states and 40991 transitions. Second operand 4 states. [2018-12-09 10:50:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:07,826 INFO L93 Difference]: Finished difference Result 16698 states and 51258 transitions. [2018-12-09 10:50:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:50:07,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 10:50:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:07,852 INFO L225 Difference]: With dead ends: 16698 [2018-12-09 10:50:07,852 INFO L226 Difference]: Without dead ends: 16698 [2018-12-09 10:50:07,852 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-09 10:50:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-12-09 10:50:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 15122. [2018-12-09 10:50:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2018-12-09 10:50:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 46581 transitions. [2018-12-09 10:50:08,056 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 46581 transitions. Word has length 68 [2018-12-09 10:50:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:08,057 INFO L480 AbstractCegarLoop]: Abstraction has 15122 states and 46581 transitions. [2018-12-09 10:50:08,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:50:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 46581 transitions. [2018-12-09 10:50:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 10:50:08,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:08,065 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] [2018-12-09 10:50:08,065 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:08,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2130013525, now seen corresponding path program 1 times [2018-12-09 10:50:08,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:08,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:08,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:08,099 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-09 10:50:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:50:08,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:08,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:50:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:50:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:50:08,100 INFO L87 Difference]: Start difference. First operand 15122 states and 46581 transitions. Second operand 3 states. [2018-12-09 10:50:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:08,292 INFO L93 Difference]: Finished difference Result 15720 states and 48233 transitions. [2018-12-09 10:50:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:50:08,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 10:50:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:08,308 INFO L225 Difference]: With dead ends: 15720 [2018-12-09 10:50:08,308 INFO L226 Difference]: Without dead ends: 15720 [2018-12-09 10:50:08,308 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-09 10:50:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15720 states. [2018-12-09 10:50:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15720 to 15448. [2018-12-09 10:50:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2018-12-09 10:50:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 47475 transitions. [2018-12-09 10:50:08,454 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 47475 transitions. Word has length 68 [2018-12-09 10:50:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:08,454 INFO L480 AbstractCegarLoop]: Abstraction has 15448 states and 47475 transitions. [2018-12-09 10:50:08,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:50:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 47475 transitions. [2018-12-09 10:50:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:08,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:08,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:50:08,462 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:08,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1509935379, now seen corresponding path program 1 times [2018-12-09 10:50:08,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:08,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:08,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:08,529 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-09 10:50:08,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:08,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:08,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:08,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:08,530 INFO L87 Difference]: Start difference. First operand 15448 states and 47475 transitions. Second operand 6 states. [2018-12-09 10:50:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:08,981 INFO L93 Difference]: Finished difference Result 18771 states and 56913 transitions. [2018-12-09 10:50:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:50:08,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 10:50:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:09,001 INFO L225 Difference]: With dead ends: 18771 [2018-12-09 10:50:09,001 INFO L226 Difference]: Without dead ends: 18771 [2018-12-09 10:50:09,001 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-09 10:50:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2018-12-09 10:50:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 17775. [2018-12-09 10:50:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17775 states. [2018-12-09 10:50:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17775 states to 17775 states and 54207 transitions. [2018-12-09 10:50:09,178 INFO L78 Accepts]: Start accepts. Automaton has 17775 states and 54207 transitions. Word has length 70 [2018-12-09 10:50:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:09,178 INFO L480 AbstractCegarLoop]: Abstraction has 17775 states and 54207 transitions. [2018-12-09 10:50:09,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17775 states and 54207 transitions. [2018-12-09 10:50:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:09,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:09,188 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] [2018-12-09 10:50:09,188 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:09,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash -567273964, now seen corresponding path program 1 times [2018-12-09 10:50:09,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:09,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:09,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:09,259 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-09 10:50:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:09,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:09,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:09,260 INFO L87 Difference]: Start difference. First operand 17775 states and 54207 transitions. Second operand 6 states. [2018-12-09 10:50:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:09,515 INFO L93 Difference]: Finished difference Result 20829 states and 61550 transitions. [2018-12-09 10:50:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:50:09,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 10:50:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:09,535 INFO L225 Difference]: With dead ends: 20829 [2018-12-09 10:50:09,535 INFO L226 Difference]: Without dead ends: 20829 [2018-12-09 10:50:09,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:50:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2018-12-09 10:50:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 18076. [2018-12-09 10:50:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18076 states. [2018-12-09 10:50:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18076 states to 18076 states and 54063 transitions. [2018-12-09 10:50:09,768 INFO L78 Accepts]: Start accepts. Automaton has 18076 states and 54063 transitions. Word has length 70 [2018-12-09 10:50:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:09,768 INFO L480 AbstractCegarLoop]: Abstraction has 18076 states and 54063 transitions. [2018-12-09 10:50:09,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18076 states and 54063 transitions. [2018-12-09 10:50:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:09,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:09,778 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] [2018-12-09 10:50:09,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash -355923051, now seen corresponding path program 1 times [2018-12-09 10:50:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:09,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:09,822 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-09 10:50:09,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:09,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:50:09,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:09,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:50:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:50:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:50:09,823 INFO L87 Difference]: Start difference. First operand 18076 states and 54063 transitions. Second operand 5 states. [2018-12-09 10:50:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:10,017 INFO L93 Difference]: Finished difference Result 22793 states and 67730 transitions. [2018-12-09 10:50:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:50:10,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 10:50:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:10,040 INFO L225 Difference]: With dead ends: 22793 [2018-12-09 10:50:10,040 INFO L226 Difference]: Without dead ends: 22793 [2018-12-09 10:50:10,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:50:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22793 states. [2018-12-09 10:50:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22793 to 19399. [2018-12-09 10:50:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19399 states. [2018-12-09 10:50:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19399 states to 19399 states and 57544 transitions. [2018-12-09 10:50:10,239 INFO L78 Accepts]: Start accepts. Automaton has 19399 states and 57544 transitions. Word has length 70 [2018-12-09 10:50:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:10,239 INFO L480 AbstractCegarLoop]: Abstraction has 19399 states and 57544 transitions. [2018-12-09 10:50:10,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:50:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19399 states and 57544 transitions. [2018-12-09 10:50:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:10,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:10,249 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] [2018-12-09 10:50:10,249 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:10,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash -866457228, now seen corresponding path program 1 times [2018-12-09 10:50:10,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:10,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:10,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:10,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:10,293 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-09 10:50:10,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:10,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:50:10,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:10,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:50:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:50:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:50:10,294 INFO L87 Difference]: Start difference. First operand 19399 states and 57544 transitions. Second operand 5 states. [2018-12-09 10:50:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:10,579 INFO L93 Difference]: Finished difference Result 26466 states and 78091 transitions. [2018-12-09 10:50:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:50:10,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 10:50:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:10,606 INFO L225 Difference]: With dead ends: 26466 [2018-12-09 10:50:10,606 INFO L226 Difference]: Without dead ends: 26466 [2018-12-09 10:50:10,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-09 10:50:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2018-12-09 10:50:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 20584. [2018-12-09 10:50:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2018-12-09 10:50:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 61050 transitions. [2018-12-09 10:50:10,842 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 61050 transitions. Word has length 70 [2018-12-09 10:50:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:10,842 INFO L480 AbstractCegarLoop]: Abstraction has 20584 states and 61050 transitions. [2018-12-09 10:50:10,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:50:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 61050 transitions. [2018-12-09 10:50:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:10,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:10,853 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] [2018-12-09 10:50:10,853 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:10,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1621055605, now seen corresponding path program 1 times [2018-12-09 10:50:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:10,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:10,890 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-09 10:50:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:10,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:50:10,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:10,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:50:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:50:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:50:10,891 INFO L87 Difference]: Start difference. First operand 20584 states and 61050 transitions. Second operand 4 states. [2018-12-09 10:50:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:11,185 INFO L93 Difference]: Finished difference Result 28448 states and 84504 transitions. [2018-12-09 10:50:11,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:50:11,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-09 10:50:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:11,219 INFO L225 Difference]: With dead ends: 28448 [2018-12-09 10:50:11,219 INFO L226 Difference]: Without dead ends: 28028 [2018-12-09 10:50:11,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:50:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28028 states. [2018-12-09 10:50:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28028 to 25836. [2018-12-09 10:50:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25836 states. [2018-12-09 10:50:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25836 states to 25836 states and 76852 transitions. [2018-12-09 10:50:11,571 INFO L78 Accepts]: Start accepts. Automaton has 25836 states and 76852 transitions. Word has length 70 [2018-12-09 10:50:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:11,571 INFO L480 AbstractCegarLoop]: Abstraction has 25836 states and 76852 transitions. [2018-12-09 10:50:11,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:50:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25836 states and 76852 transitions. [2018-12-09 10:50:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 10:50:11,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:11,584 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] [2018-12-09 10:50:11,585 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:11,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -175895754, now seen corresponding path program 1 times [2018-12-09 10:50:11,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:11,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:11,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:11,626 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-09 10:50:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:50:11,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:11,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:50:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:50:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:50:11,627 INFO L87 Difference]: Start difference. First operand 25836 states and 76852 transitions. Second operand 5 states. [2018-12-09 10:50:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:11,687 INFO L93 Difference]: Finished difference Result 7052 states and 16992 transitions. [2018-12-09 10:50:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:50:11,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 10:50:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:11,691 INFO L225 Difference]: With dead ends: 7052 [2018-12-09 10:50:11,691 INFO L226 Difference]: Without dead ends: 5565 [2018-12-09 10:50:11,691 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-09 10:50:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2018-12-09 10:50:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 4891. [2018-12-09 10:50:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2018-12-09 10:50:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 11544 transitions. [2018-12-09 10:50:11,725 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 11544 transitions. Word has length 70 [2018-12-09 10:50:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:11,726 INFO L480 AbstractCegarLoop]: Abstraction has 4891 states and 11544 transitions. [2018-12-09 10:50:11,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:50:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 11544 transitions. [2018-12-09 10:50:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 10:50:11,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:50:11,729 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:11,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 309213051, now seen corresponding path program 1 times [2018-12-09 10:50:11,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:11,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:11,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:50:11,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:11,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:50:11,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:11,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:50:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:50:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:50:11,778 INFO L87 Difference]: Start difference. First operand 4891 states and 11544 transitions. Second operand 7 states. [2018-12-09 10:50:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:12,029 INFO L93 Difference]: Finished difference Result 6133 states and 14405 transitions. [2018-12-09 10:50:12,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:50:12,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-09 10:50:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:12,033 INFO L225 Difference]: With dead ends: 6133 [2018-12-09 10:50:12,033 INFO L226 Difference]: Without dead ends: 6133 [2018-12-09 10:50:12,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:50:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2018-12-09 10:50:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5041. [2018-12-09 10:50:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5041 states. [2018-12-09 10:50:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 11934 transitions. [2018-12-09 10:50:12,080 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 11934 transitions. Word has length 85 [2018-12-09 10:50:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:12,080 INFO L480 AbstractCegarLoop]: Abstraction has 5041 states and 11934 transitions. [2018-12-09 10:50:12,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:50:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 11934 transitions. [2018-12-09 10:50:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 10:50:12,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:12,083 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] [2018-12-09 10:50:12,083 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:12,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash -207232480, now seen corresponding path program 1 times [2018-12-09 10:50:12,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:12,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:12,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:12,150 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-09 10:50:12,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:12,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:12,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:12,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:12,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:12,151 INFO L87 Difference]: Start difference. First operand 5041 states and 11934 transitions. Second operand 6 states. [2018-12-09 10:50:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:12,210 INFO L93 Difference]: Finished difference Result 4785 states and 11118 transitions. [2018-12-09 10:50:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:50:12,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-09 10:50:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:12,214 INFO L225 Difference]: With dead ends: 4785 [2018-12-09 10:50:12,214 INFO L226 Difference]: Without dead ends: 4785 [2018-12-09 10:50:12,214 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-09 10:50:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2018-12-09 10:50:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 3198. [2018-12-09 10:50:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2018-12-09 10:50:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7488 transitions. [2018-12-09 10:50:12,239 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7488 transitions. Word has length 85 [2018-12-09 10:50:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:12,239 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7488 transitions. [2018-12-09 10:50:12,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7488 transitions. [2018-12-09 10:50:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 10:50:12,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:12,241 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] [2018-12-09 10:50:12,241 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:12,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 621983452, now seen corresponding path program 1 times [2018-12-09 10:50:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:12,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:12,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:12,316 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-09 10:50:12,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:12,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:50:12,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:12,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:50:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:50:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:50:12,317 INFO L87 Difference]: Start difference. First operand 3198 states and 7488 transitions. Second operand 6 states. [2018-12-09 10:50:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:12,409 INFO L93 Difference]: Finished difference Result 3669 states and 8477 transitions. [2018-12-09 10:50:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:50:12,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-09 10:50:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:12,411 INFO L225 Difference]: With dead ends: 3669 [2018-12-09 10:50:12,411 INFO L226 Difference]: Without dead ends: 3611 [2018-12-09 10:50:12,412 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-09 10:50:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2018-12-09 10:50:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 2854. [2018-12-09 10:50:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2018-12-09 10:50:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 6564 transitions. [2018-12-09 10:50:12,431 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 6564 transitions. Word has length 87 [2018-12-09 10:50:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:12,431 INFO L480 AbstractCegarLoop]: Abstraction has 2854 states and 6564 transitions. [2018-12-09 10:50:12,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:50:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 6564 transitions. [2018-12-09 10:50:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 10:50:12,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:12,433 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] [2018-12-09 10:50:12,433 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:12,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1455225891, now seen corresponding path program 1 times [2018-12-09 10:50:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:12,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:50:12,519 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-09 10:50:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:50:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 10:50:12,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:50:12,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 10:50:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:50:12,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:50:12,520 INFO L87 Difference]: Start difference. First operand 2854 states and 6564 transitions. Second operand 11 states. [2018-12-09 10:50:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:50:13,324 INFO L93 Difference]: Finished difference Result 5034 states and 11604 transitions. [2018-12-09 10:50:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:50:13,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-12-09 10:50:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:50:13,326 INFO L225 Difference]: With dead ends: 5034 [2018-12-09 10:50:13,327 INFO L226 Difference]: Without dead ends: 3558 [2018-12-09 10:50:13,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 10:50:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2018-12-09 10:50:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3030. [2018-12-09 10:50:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2018-12-09 10:50:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 6945 transitions. [2018-12-09 10:50:13,347 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 6945 transitions. Word has length 87 [2018-12-09 10:50:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:50:13,347 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 6945 transitions. [2018-12-09 10:50:13,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 10:50:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 6945 transitions. [2018-12-09 10:50:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 10:50:13,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:50:13,349 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] [2018-12-09 10:50:13,349 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:50:13,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:50:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -208052547, now seen corresponding path program 2 times [2018-12-09 10:50:13,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:50:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:50:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:50:13,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:50:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:50:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:50:13,383 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:50:13,449 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:50:13,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:50:13 BasicIcfg [2018-12-09 10:50:13,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:50:13,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:50:13,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:50:13,450 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:50:13,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:50:02" (3/4) ... [2018-12-09 10:50:13,452 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:50:13,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0c9c768-87f0-437d-b479-e02cce9c9d4a/bin-2019/utaipan/witness.graphml [2018-12-09 10:50:13,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:50:13,518 INFO L168 Benchmark]: Toolchain (without parser) took 11442.72 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 901.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,519 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:50:13,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.13 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,520 INFO L168 Benchmark]: Boogie Preprocessor took 19.02 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-09 10:50:13,520 INFO L168 Benchmark]: RCFGBuilder took 314.38 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: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,520 INFO L168 Benchmark]: TraceAbstraction took 10660.71 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 982.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.4 MB). Peak memory consumption was 853.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,520 INFO L168 Benchmark]: Witness Printer took 67.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:50:13,521 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.13 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.02 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 314.38 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: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10660.71 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 982.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.4 MB). Peak memory consumption was 853.2 MB. Max. memory is 11.5 GB. * Witness Printer took 67.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L694] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L695] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L696] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$w_buff1 = y$w_buff0 [L745] 0 y$w_buff0 = 1 [L746] 0 y$w_buff1_used = y$w_buff0_used [L747] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 0 y$r_buff0_thd2 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p1_EAX = z [L761] 0 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L716] 1 __unbuffered_p0_EAX = x [L719] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L720] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L721] 1 y$flush_delayed = weak$$choice2 [L722] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L724] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L726] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L727] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L729] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L730] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L731] 1 y = y$flush_delayed ? y$mem_tmp : y [L732] 1 y$flush_delayed = (_Bool)0 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. UNSAFE Result, 10.5s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5220 SDtfs, 5605 SDslu, 10915 SDs, 0 SdLazy, 4640 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27858occurred 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: 3.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 52740 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1261 ConstructedInterpolants, 0 QuantifiedInterpolants, 225884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...