./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_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_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/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 df823c9c960fe14b6c8d6a9a95ba970929f56e0b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:25:57,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:25:57,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:25:57,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:25:57,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:25:57,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:25:57,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:25:57,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:25:57,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:25:57,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:25:57,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:25:57,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:25:57,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:25:57,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:25:57,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:25:57,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:25:57,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:25:57,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:25:57,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:25:57,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:25:57,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:25:57,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:25:57,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:25:57,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:25:57,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:25:57,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:25:57,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:25:57,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:25:57,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:25:57,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:25:57,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:25:57,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:25:57,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:25:57,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:25:57,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:25:57,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:25:57,285 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:25:57,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:25:57,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:25:57,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:25:57,293 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:25:57,293 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:25:57,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:25:57,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:25:57,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:25:57,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:25:57,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:25:57,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:25:57,296 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_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/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 -> df823c9c960fe14b6c8d6a9a95ba970929f56e0b [2018-12-02 14:25:57,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:25:57,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:25:57,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:25:57,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:25:57,323 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:25:57,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i [2018-12-02 14:25:57,358 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/data/80d723688/01ba5494192d4962875adf377de36a7b/FLAGa25d43d18 [2018-12-02 14:25:57,783 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:25:57,784 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i [2018-12-02 14:25:57,791 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/data/80d723688/01ba5494192d4962875adf377de36a7b/FLAGa25d43d18 [2018-12-02 14:25:57,799 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/data/80d723688/01ba5494192d4962875adf377de36a7b [2018-12-02 14:25:57,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:25:57,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:25:57,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:25:57,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:25:57,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:25:57,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:25:57" (1/1) ... [2018-12-02 14:25:57,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:57, skipping insertion in model container [2018-12-02 14:25:57,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:25:57" (1/1) ... [2018-12-02 14:25:57,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:25:57,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:25:58,016 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:25:58,024 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:25:58,106 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:25:58,136 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:25:58,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58 WrapperNode [2018-12-02 14:25:58,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:25:58,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:25:58,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:25:58,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:25:58,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:25:58,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:25:58,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:25:58,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:25:58,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... [2018-12-02 14:25:58,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:25:58,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:25:58,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:25:58,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:25:58,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:25:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:25:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:25:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 14:25:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:25:58,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 14:25:58,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 14:25:58,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 14:25:58,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 14:25:58,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 14:25:58,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:25:58,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:25:58,228 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 14:25:58,596 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:25:58,596 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 14:25:58,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:58 BoogieIcfgContainer [2018-12-02 14:25:58,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:25:58,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:25:58,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:25:58,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:25:58,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:25:57" (1/3) ... [2018-12-02 14:25:58,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303791f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:25:58, skipping insertion in model container [2018-12-02 14:25:58,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:58" (2/3) ... [2018-12-02 14:25:58,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303791f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:25:58, skipping insertion in model container [2018-12-02 14:25:58,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:58" (3/3) ... [2018-12-02 14:25:58,601 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.oepc_false-unreach-call.i [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,639 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,642 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:25:58,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 14:25:58,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:25:58,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 14:25:58,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 14:25:58,689 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:25:58,689 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:25:58,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:25:58,689 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:25:58,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:25:58,689 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:25:58,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:25:58,689 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:25:58,696 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-02 14:26:06,960 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-02 14:26:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-02 14:26:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 14:26:06,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:06,967 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] [2018-12-02 14:26:06,969 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:06,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-02 14:26:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:07,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:07,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:07,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:07,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:07,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:07,123 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-02 14:26:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:08,531 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-02 14:26:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:26:08,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 14:26:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:08,969 INFO L225 Difference]: With dead ends: 192000 [2018-12-02 14:26:08,969 INFO L226 Difference]: Without dead ends: 135832 [2018-12-02 14:26:08,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-02 14:26:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-02 14:26:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-02 14:26:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-02 14:26:11,863 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-02 14:26:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:11,864 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-02 14:26:11,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-02 14:26:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 14:26:11,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:11,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:11,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:11,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-02 14:26:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:11,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:11,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:11,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:11,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:11,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:11,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:11,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:11,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:11,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:11,925 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 4 states. [2018-12-02 14:26:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:12,021 INFO L93 Difference]: Finished difference Result 16846 states and 57032 transitions. [2018-12-02 14:26:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:26:12,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 14:26:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:12,051 INFO L225 Difference]: With dead ends: 16846 [2018-12-02 14:26:12,051 INFO L226 Difference]: Without dead ends: 13306 [2018-12-02 14:26:12,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2018-12-02 14:26:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13306. [2018-12-02 14:26:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2018-12-02 14:26:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 43727 transitions. [2018-12-02 14:26:12,206 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 43727 transitions. Word has length 47 [2018-12-02 14:26:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 13306 states and 43727 transitions. [2018-12-02 14:26:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 43727 transitions. [2018-12-02 14:26:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 14:26:12,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:12,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:12,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:12,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-02 14:26:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:12,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:12,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:12,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:26:12,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:12,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:26:12,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:26:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:12,258 INFO L87 Difference]: Start difference. First operand 13306 states and 43727 transitions. Second operand 5 states. [2018-12-02 14:26:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:12,685 INFO L93 Difference]: Finished difference Result 25424 states and 82823 transitions. [2018-12-02 14:26:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:26:12,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 14:26:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:12,727 INFO L225 Difference]: With dead ends: 25424 [2018-12-02 14:26:12,727 INFO L226 Difference]: Without dead ends: 25356 [2018-12-02 14:26:12,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:26:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25356 states. [2018-12-02 14:26:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25356 to 16160. [2018-12-02 14:26:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2018-12-02 14:26:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 51762 transitions. [2018-12-02 14:26:12,954 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 51762 transitions. Word has length 48 [2018-12-02 14:26:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:12,955 INFO L480 AbstractCegarLoop]: Abstraction has 16160 states and 51762 transitions. [2018-12-02 14:26:12,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:26:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 51762 transitions. [2018-12-02 14:26:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 14:26:12,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:12,956 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-02 14:26:12,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-02 14:26:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:12,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:12,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:12,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:26:12,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:12,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:26:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:26:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:12,984 INFO L87 Difference]: Start difference. First operand 16160 states and 51762 transitions. Second operand 3 states. [2018-12-02 14:26:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:13,111 INFO L93 Difference]: Finished difference Result 30242 states and 95729 transitions. [2018-12-02 14:26:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:26:13,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 14:26:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:13,151 INFO L225 Difference]: With dead ends: 30242 [2018-12-02 14:26:13,151 INFO L226 Difference]: Without dead ends: 30242 [2018-12-02 14:26:13,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30242 states. [2018-12-02 14:26:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30242 to 24713. [2018-12-02 14:26:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2018-12-02 14:26:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 78043 transitions. [2018-12-02 14:26:13,469 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 78043 transitions. Word has length 50 [2018-12-02 14:26:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:13,469 INFO L480 AbstractCegarLoop]: Abstraction has 24713 states and 78043 transitions. [2018-12-02 14:26:13,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:26:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 78043 transitions. [2018-12-02 14:26:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 14:26:13,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:13,471 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] [2018-12-02 14:26:13,471 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:13,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-02 14:26:13,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:13,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:13,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:13,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:13,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:13,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:13,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:26:13,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:13,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:26:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:26:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:26:13,526 INFO L87 Difference]: Start difference. First operand 24713 states and 78043 transitions. Second operand 6 states. [2018-12-02 14:26:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:13,944 INFO L93 Difference]: Finished difference Result 35355 states and 111009 transitions. [2018-12-02 14:26:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:26:13,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 14:26:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:13,990 INFO L225 Difference]: With dead ends: 35355 [2018-12-02 14:26:13,990 INFO L226 Difference]: Without dead ends: 35283 [2018-12-02 14:26:13,991 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-02 14:26:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35283 states. [2018-12-02 14:26:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35283 to 24760. [2018-12-02 14:26:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2018-12-02 14:26:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 78149 transitions. [2018-12-02 14:26:14,335 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 78149 transitions. Word has length 54 [2018-12-02 14:26:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:14,335 INFO L480 AbstractCegarLoop]: Abstraction has 24760 states and 78149 transitions. [2018-12-02 14:26:14,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:26:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 78149 transitions. [2018-12-02 14:26:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 14:26:14,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:14,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:14,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:14,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-02 14:26:14,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:14,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:14,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:14,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:14,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:14,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:14,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:14,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:14,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:14,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:14,377 INFO L87 Difference]: Start difference. First operand 24760 states and 78149 transitions. Second operand 4 states. [2018-12-02 14:26:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:14,499 INFO L93 Difference]: Finished difference Result 27198 states and 85598 transitions. [2018-12-02 14:26:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:26:14,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 14:26:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:14,535 INFO L225 Difference]: With dead ends: 27198 [2018-12-02 14:26:14,535 INFO L226 Difference]: Without dead ends: 27198 [2018-12-02 14:26:14,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27198 states. [2018-12-02 14:26:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27198 to 25605. [2018-12-02 14:26:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25605 states. [2018-12-02 14:26:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25605 states to 25605 states and 80704 transitions. [2018-12-02 14:26:14,940 INFO L78 Accepts]: Start accepts. Automaton has 25605 states and 80704 transitions. Word has length 62 [2018-12-02 14:26:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:14,941 INFO L480 AbstractCegarLoop]: Abstraction has 25605 states and 80704 transitions. [2018-12-02 14:26:14,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 25605 states and 80704 transitions. [2018-12-02 14:26:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 14:26:14,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:14,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:14,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:14,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-02 14:26:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:14,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:14,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:14,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:26:14,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:14,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:26:14,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:26:14,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:26:14,995 INFO L87 Difference]: Start difference. First operand 25605 states and 80704 transitions. Second operand 6 states. [2018-12-02 14:26:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:15,529 INFO L93 Difference]: Finished difference Result 53487 states and 166575 transitions. [2018-12-02 14:26:15,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:26:15,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 14:26:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:15,598 INFO L225 Difference]: With dead ends: 53487 [2018-12-02 14:26:15,598 INFO L226 Difference]: Without dead ends: 53416 [2018-12-02 14:26:15,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:26:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53416 states. [2018-12-02 14:26:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53416 to 33743. [2018-12-02 14:26:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33743 states. [2018-12-02 14:26:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33743 states to 33743 states and 103588 transitions. [2018-12-02 14:26:16,102 INFO L78 Accepts]: Start accepts. Automaton has 33743 states and 103588 transitions. Word has length 62 [2018-12-02 14:26:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:16,102 INFO L480 AbstractCegarLoop]: Abstraction has 33743 states and 103588 transitions. [2018-12-02 14:26:16,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:26:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33743 states and 103588 transitions. [2018-12-02 14:26:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 14:26:16,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:16,109 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-02 14:26:16,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:16,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-02 14:26:16,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:16,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:16,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:16,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:16,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:26:16,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:16,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:26:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:26:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:16,134 INFO L87 Difference]: Start difference. First operand 33743 states and 103588 transitions. Second operand 3 states. [2018-12-02 14:26:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:16,278 INFO L93 Difference]: Finished difference Result 42382 states and 129040 transitions. [2018-12-02 14:26:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:26:16,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 14:26:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:16,330 INFO L225 Difference]: With dead ends: 42382 [2018-12-02 14:26:16,330 INFO L226 Difference]: Without dead ends: 42382 [2018-12-02 14:26:16,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2018-12-02 14:26:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 34500. [2018-12-02 14:26:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34500 states. [2018-12-02 14:26:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34500 states to 34500 states and 104065 transitions. [2018-12-02 14:26:16,758 INFO L78 Accepts]: Start accepts. Automaton has 34500 states and 104065 transitions. Word has length 68 [2018-12-02 14:26:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:16,758 INFO L480 AbstractCegarLoop]: Abstraction has 34500 states and 104065 transitions. [2018-12-02 14:26:16,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:26:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34500 states and 104065 transitions. [2018-12-02 14:26:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 14:26:16,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:16,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:16,768 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:16,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-02 14:26:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:16,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:26:16,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:16,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:26:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:26:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:16,818 INFO L87 Difference]: Start difference. First operand 34500 states and 104065 transitions. Second operand 5 states. [2018-12-02 14:26:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:17,173 INFO L93 Difference]: Finished difference Result 39525 states and 118876 transitions. [2018-12-02 14:26:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:26:17,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-02 14:26:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:17,224 INFO L225 Difference]: With dead ends: 39525 [2018-12-02 14:26:17,224 INFO L226 Difference]: Without dead ends: 39525 [2018-12-02 14:26:17,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:26:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39525 states. [2018-12-02 14:26:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39525 to 37850. [2018-12-02 14:26:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37850 states. [2018-12-02 14:26:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37850 states to 37850 states and 113960 transitions. [2018-12-02 14:26:17,784 INFO L78 Accepts]: Start accepts. Automaton has 37850 states and 113960 transitions. Word has length 74 [2018-12-02 14:26:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:17,784 INFO L480 AbstractCegarLoop]: Abstraction has 37850 states and 113960 transitions. [2018-12-02 14:26:17,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:26:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 37850 states and 113960 transitions. [2018-12-02 14:26:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 14:26:17,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:17,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:17,794 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-02 14:26:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:17,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:17,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:17,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:17,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:17,854 INFO L87 Difference]: Start difference. First operand 37850 states and 113960 transitions. Second operand 7 states. [2018-12-02 14:26:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:18,391 INFO L93 Difference]: Finished difference Result 45108 states and 135862 transitions. [2018-12-02 14:26:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:26:18,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 14:26:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:18,445 INFO L225 Difference]: With dead ends: 45108 [2018-12-02 14:26:18,445 INFO L226 Difference]: Without dead ends: 45021 [2018-12-02 14:26:18,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 14:26:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45021 states. [2018-12-02 14:26:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45021 to 34028. [2018-12-02 14:26:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34028 states. [2018-12-02 14:26:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34028 states to 34028 states and 103850 transitions. [2018-12-02 14:26:18,887 INFO L78 Accepts]: Start accepts. Automaton has 34028 states and 103850 transitions. Word has length 74 [2018-12-02 14:26:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:18,887 INFO L480 AbstractCegarLoop]: Abstraction has 34028 states and 103850 transitions. [2018-12-02 14:26:18,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34028 states and 103850 transitions. [2018-12-02 14:26:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 14:26:18,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:18,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:18,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:18,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-02 14:26:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:18,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:18,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:18,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:18,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:18,934 INFO L87 Difference]: Start difference. First operand 34028 states and 103850 transitions. Second operand 4 states. [2018-12-02 14:26:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:19,384 INFO L93 Difference]: Finished difference Result 47561 states and 141031 transitions. [2018-12-02 14:26:19,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:26:19,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 14:26:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:19,439 INFO L225 Difference]: With dead ends: 47561 [2018-12-02 14:26:19,439 INFO L226 Difference]: Without dead ends: 47561 [2018-12-02 14:26:19,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47561 states. [2018-12-02 14:26:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47561 to 42225. [2018-12-02 14:26:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42225 states. [2018-12-02 14:26:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42225 states to 42225 states and 126425 transitions. [2018-12-02 14:26:19,942 INFO L78 Accepts]: Start accepts. Automaton has 42225 states and 126425 transitions. Word has length 76 [2018-12-02 14:26:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:19,942 INFO L480 AbstractCegarLoop]: Abstraction has 42225 states and 126425 transitions. [2018-12-02 14:26:19,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42225 states and 126425 transitions. [2018-12-02 14:26:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 14:26:19,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:19,957 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] [2018-12-02 14:26:19,958 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:19,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1204792523, now seen corresponding path program 1 times [2018-12-02 14:26:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:19,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:20,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:20,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:20,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:20,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:20,021 INFO L87 Difference]: Start difference. First operand 42225 states and 126425 transitions. Second operand 7 states. [2018-12-02 14:26:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:21,011 INFO L93 Difference]: Finished difference Result 98343 states and 291285 transitions. [2018-12-02 14:26:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 14:26:21,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-02 14:26:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:21,125 INFO L225 Difference]: With dead ends: 98343 [2018-12-02 14:26:21,125 INFO L226 Difference]: Without dead ends: 98279 [2018-12-02 14:26:21,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:26:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98279 states. [2018-12-02 14:26:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98279 to 57323. [2018-12-02 14:26:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57323 states. [2018-12-02 14:26:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57323 states to 57323 states and 168943 transitions. [2018-12-02 14:26:21,970 INFO L78 Accepts]: Start accepts. Automaton has 57323 states and 168943 transitions. Word has length 76 [2018-12-02 14:26:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:21,971 INFO L480 AbstractCegarLoop]: Abstraction has 57323 states and 168943 transitions. [2018-12-02 14:26:21,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 57323 states and 168943 transitions. [2018-12-02 14:26:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 14:26:21,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:21,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:21,995 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:21,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash -885471404, now seen corresponding path program 1 times [2018-12-02 14:26:21,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:21,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:22,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:22,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:22,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:22,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:22,047 INFO L87 Difference]: Start difference. First operand 57323 states and 168943 transitions. Second operand 4 states. [2018-12-02 14:26:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:22,334 INFO L93 Difference]: Finished difference Result 63745 states and 186999 transitions. [2018-12-02 14:26:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:26:22,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 14:26:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:22,407 INFO L225 Difference]: With dead ends: 63745 [2018-12-02 14:26:22,407 INFO L226 Difference]: Without dead ends: 63745 [2018-12-02 14:26:22,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63745 states. [2018-12-02 14:26:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63745 to 62467. [2018-12-02 14:26:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62467 states. [2018-12-02 14:26:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62467 states to 62467 states and 183268 transitions. [2018-12-02 14:26:23,095 INFO L78 Accepts]: Start accepts. Automaton has 62467 states and 183268 transitions. Word has length 82 [2018-12-02 14:26:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:23,095 INFO L480 AbstractCegarLoop]: Abstraction has 62467 states and 183268 transitions. [2018-12-02 14:26:23,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 62467 states and 183268 transitions. [2018-12-02 14:26:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 14:26:23,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:23,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:23,122 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:23,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1332286549, now seen corresponding path program 1 times [2018-12-02 14:26:23,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:23,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:23,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:26:23,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:23,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:26:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:26:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:23,154 INFO L87 Difference]: Start difference. First operand 62467 states and 183268 transitions. Second operand 3 states. [2018-12-02 14:26:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:23,461 INFO L93 Difference]: Finished difference Result 74968 states and 215886 transitions. [2018-12-02 14:26:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:26:23,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-02 14:26:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:23,552 INFO L225 Difference]: With dead ends: 74968 [2018-12-02 14:26:23,552 INFO L226 Difference]: Without dead ends: 74968 [2018-12-02 14:26:23,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74968 states. [2018-12-02 14:26:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74968 to 70220. [2018-12-02 14:26:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70220 states. [2018-12-02 14:26:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70220 states to 70220 states and 203363 transitions. [2018-12-02 14:26:25,700 INFO L78 Accepts]: Start accepts. Automaton has 70220 states and 203363 transitions. Word has length 82 [2018-12-02 14:26:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:25,700 INFO L480 AbstractCegarLoop]: Abstraction has 70220 states and 203363 transitions. [2018-12-02 14:26:25,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:26:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 70220 states and 203363 transitions. [2018-12-02 14:26:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 14:26:25,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:25,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:25,727 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:25,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1045447395, now seen corresponding path program 1 times [2018-12-02 14:26:25,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:25,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:25,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:25,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:26:25,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:25,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:26:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:26:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:26:25,770 INFO L87 Difference]: Start difference. First operand 70220 states and 203363 transitions. Second operand 4 states. [2018-12-02 14:26:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:25,992 INFO L93 Difference]: Finished difference Result 76675 states and 219295 transitions. [2018-12-02 14:26:25,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:26:25,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 14:26:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:26,088 INFO L225 Difference]: With dead ends: 76675 [2018-12-02 14:26:26,089 INFO L226 Difference]: Without dead ends: 76675 [2018-12-02 14:26:26,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76675 states. [2018-12-02 14:26:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76675 to 71702. [2018-12-02 14:26:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-02 14:26:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-02 14:26:26,929 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-02 14:26:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:26,929 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-02 14:26:26,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:26:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-02 14:26:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 14:26:26,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:26,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:26,956 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 261296668, now seen corresponding path program 1 times [2018-12-02 14:26:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:26,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:26,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:27,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 14:26:27,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:27,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:26:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:26:27,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:26:27,027 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-02 14:26:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:28,893 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-02 14:26:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 14:26:28,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-02 14:26:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:29,116 INFO L225 Difference]: With dead ends: 164487 [2018-12-02 14:26:29,116 INFO L226 Difference]: Without dead ends: 164487 [2018-12-02 14:26:29,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-02 14:26:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-02 14:26:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-02 14:26:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-02 14:26:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-02 14:26:30,821 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-02 14:26:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:30,821 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-02 14:26:30,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:26:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-02 14:26:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 14:26:30,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:30,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:30,858 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:30,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1148800349, now seen corresponding path program 1 times [2018-12-02 14:26:30,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:30,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:30,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:30,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:30,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:30,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:30,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:30,934 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 7 states. [2018-12-02 14:26:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:31,375 INFO L93 Difference]: Finished difference Result 129729 states and 381989 transitions. [2018-12-02 14:26:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:26:31,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-02 14:26:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:31,548 INFO L225 Difference]: With dead ends: 129729 [2018-12-02 14:26:31,549 INFO L226 Difference]: Without dead ends: 129729 [2018-12-02 14:26:31,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:26:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129729 states. [2018-12-02 14:26:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129729 to 85081. [2018-12-02 14:26:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85081 states. [2018-12-02 14:26:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85081 states to 85081 states and 245768 transitions. [2018-12-02 14:26:32,736 INFO L78 Accepts]: Start accepts. Automaton has 85081 states and 245768 transitions. Word has length 83 [2018-12-02 14:26:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:32,736 INFO L480 AbstractCegarLoop]: Abstraction has 85081 states and 245768 transitions. [2018-12-02 14:26:32,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 85081 states and 245768 transitions. [2018-12-02 14:26:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 14:26:32,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:32,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:32,764 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:32,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash -583175203, now seen corresponding path program 1 times [2018-12-02 14:26:32,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:32,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:32,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:32,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:26:32,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:32,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:26:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:26:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:32,827 INFO L87 Difference]: Start difference. First operand 85081 states and 245768 transitions. Second operand 5 states. [2018-12-02 14:26:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:33,132 INFO L93 Difference]: Finished difference Result 85353 states and 246524 transitions. [2018-12-02 14:26:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:26:33,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-02 14:26:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:33,235 INFO L225 Difference]: With dead ends: 85353 [2018-12-02 14:26:33,236 INFO L226 Difference]: Without dead ends: 85353 [2018-12-02 14:26:33,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:26:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85353 states. [2018-12-02 14:26:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85353 to 85177. [2018-12-02 14:26:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85177 states. [2018-12-02 14:26:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85177 states to 85177 states and 246040 transitions. [2018-12-02 14:26:34,173 INFO L78 Accepts]: Start accepts. Automaton has 85177 states and 246040 transitions. Word has length 83 [2018-12-02 14:26:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:34,174 INFO L480 AbstractCegarLoop]: Abstraction has 85177 states and 246040 transitions. [2018-12-02 14:26:34,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:26:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 85177 states and 246040 transitions. [2018-12-02 14:26:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 14:26:34,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:34,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:34,202 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:34,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash 304328478, now seen corresponding path program 1 times [2018-12-02 14:26:34,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:34,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:34,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:34,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:34,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:26:34,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:34,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:26:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:26:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:34,248 INFO L87 Difference]: Start difference. First operand 85177 states and 246040 transitions. Second operand 5 states. [2018-12-02 14:26:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:34,329 INFO L93 Difference]: Finished difference Result 31369 states and 74664 transitions. [2018-12-02 14:26:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:26:34,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-02 14:26:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:34,352 INFO L225 Difference]: With dead ends: 31369 [2018-12-02 14:26:34,352 INFO L226 Difference]: Without dead ends: 27633 [2018-12-02 14:26:34,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27633 states. [2018-12-02 14:26:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27633 to 24406. [2018-12-02 14:26:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24406 states. [2018-12-02 14:26:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24406 states to 24406 states and 57167 transitions. [2018-12-02 14:26:34,620 INFO L78 Accepts]: Start accepts. Automaton has 24406 states and 57167 transitions. Word has length 83 [2018-12-02 14:26:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:34,620 INFO L480 AbstractCegarLoop]: Abstraction has 24406 states and 57167 transitions. [2018-12-02 14:26:34,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:26:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 24406 states and 57167 transitions. [2018-12-02 14:26:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 14:26:34,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:34,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:34,641 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:34,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1185306129, now seen corresponding path program 1 times [2018-12-02 14:26:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:34,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:34,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:34,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:34,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:34,800 INFO L87 Difference]: Start difference. First operand 24406 states and 57167 transitions. Second operand 7 states. [2018-12-02 14:26:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:35,299 INFO L93 Difference]: Finished difference Result 32759 states and 76830 transitions. [2018-12-02 14:26:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:26:35,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 14:26:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:35,323 INFO L225 Difference]: With dead ends: 32759 [2018-12-02 14:26:35,324 INFO L226 Difference]: Without dead ends: 32759 [2018-12-02 14:26:35,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:26:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32759 states. [2018-12-02 14:26:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32759 to 24724. [2018-12-02 14:26:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24724 states. [2018-12-02 14:26:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24724 states to 24724 states and 57984 transitions. [2018-12-02 14:26:35,587 INFO L78 Accepts]: Start accepts. Automaton has 24724 states and 57984 transitions. Word has length 111 [2018-12-02 14:26:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:35,587 INFO L480 AbstractCegarLoop]: Abstraction has 24724 states and 57984 transitions. [2018-12-02 14:26:35,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 24724 states and 57984 transitions. [2018-12-02 14:26:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 14:26:35,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:35,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:35,605 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:35,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2072809810, now seen corresponding path program 1 times [2018-12-02 14:26:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:35,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:35,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:35,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:26:35,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:35,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:26:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:26:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:26:35,716 INFO L87 Difference]: Start difference. First operand 24724 states and 57984 transitions. Second operand 9 states. [2018-12-02 14:26:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:36,225 INFO L93 Difference]: Finished difference Result 32630 states and 75653 transitions. [2018-12-02 14:26:36,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:26:36,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2018-12-02 14:26:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:36,250 INFO L225 Difference]: With dead ends: 32630 [2018-12-02 14:26:36,250 INFO L226 Difference]: Without dead ends: 32630 [2018-12-02 14:26:36,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:26:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32630 states. [2018-12-02 14:26:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32630 to 27513. [2018-12-02 14:26:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27513 states. [2018-12-02 14:26:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27513 states to 27513 states and 63917 transitions. [2018-12-02 14:26:36,522 INFO L78 Accepts]: Start accepts. Automaton has 27513 states and 63917 transitions. Word has length 111 [2018-12-02 14:26:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 27513 states and 63917 transitions. [2018-12-02 14:26:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:26:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 27513 states and 63917 transitions. [2018-12-02 14:26:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 14:26:36,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:36,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:36,544 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:36,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash -878975780, now seen corresponding path program 2 times [2018-12-02 14:26:36,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:36,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:36,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:36,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:36,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 14:26:36,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:36,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:26:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:26:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:26:36,658 INFO L87 Difference]: Start difference. First operand 27513 states and 63917 transitions. Second operand 8 states. [2018-12-02 14:26:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:37,254 INFO L93 Difference]: Finished difference Result 35001 states and 81311 transitions. [2018-12-02 14:26:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:26:37,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-02 14:26:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:37,281 INFO L225 Difference]: With dead ends: 35001 [2018-12-02 14:26:37,281 INFO L226 Difference]: Without dead ends: 35001 [2018-12-02 14:26:37,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:26:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35001 states. [2018-12-02 14:26:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35001 to 27629. [2018-12-02 14:26:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27629 states. [2018-12-02 14:26:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27629 states to 27629 states and 64304 transitions. [2018-12-02 14:26:37,565 INFO L78 Accepts]: Start accepts. Automaton has 27629 states and 64304 transitions. Word has length 111 [2018-12-02 14:26:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:37,566 INFO L480 AbstractCegarLoop]: Abstraction has 27629 states and 64304 transitions. [2018-12-02 14:26:37,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:26:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27629 states and 64304 transitions. [2018-12-02 14:26:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 14:26:37,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:37,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:37,587 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:37,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2095629092, now seen corresponding path program 3 times [2018-12-02 14:26:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:37,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:26:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:37,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:37,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:26:37,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:37,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:26:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:26:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:26:37,639 INFO L87 Difference]: Start difference. First operand 27629 states and 64304 transitions. Second operand 5 states. [2018-12-02 14:26:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:37,837 INFO L93 Difference]: Finished difference Result 28037 states and 65172 transitions. [2018-12-02 14:26:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:26:37,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 14:26:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:37,859 INFO L225 Difference]: With dead ends: 28037 [2018-12-02 14:26:37,859 INFO L226 Difference]: Without dead ends: 28037 [2018-12-02 14:26:37,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28037 states. [2018-12-02 14:26:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28037 to 27826. [2018-12-02 14:26:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27826 states. [2018-12-02 14:26:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27826 states to 27826 states and 64738 transitions. [2018-12-02 14:26:38,100 INFO L78 Accepts]: Start accepts. Automaton has 27826 states and 64738 transitions. Word has length 111 [2018-12-02 14:26:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:38,101 INFO L480 AbstractCegarLoop]: Abstraction has 27826 states and 64738 transitions. [2018-12-02 14:26:38,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:26:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27826 states and 64738 transitions. [2018-12-02 14:26:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 14:26:38,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:38,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:38,121 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:38,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1423390112, now seen corresponding path program 1 times [2018-12-02 14:26:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:38,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:26:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:38,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:38,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:38,193 INFO L87 Difference]: Start difference. First operand 27826 states and 64738 transitions. Second operand 7 states. [2018-12-02 14:26:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:38,499 INFO L93 Difference]: Finished difference Result 37582 states and 86234 transitions. [2018-12-02 14:26:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:26:38,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 14:26:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:38,528 INFO L225 Difference]: With dead ends: 37582 [2018-12-02 14:26:38,528 INFO L226 Difference]: Without dead ends: 37520 [2018-12-02 14:26:38,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:26:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37520 states. [2018-12-02 14:26:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37520 to 29957. [2018-12-02 14:26:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29957 states. [2018-12-02 14:26:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29957 states to 29957 states and 69194 transitions. [2018-12-02 14:26:38,836 INFO L78 Accepts]: Start accepts. Automaton has 29957 states and 69194 transitions. Word has length 113 [2018-12-02 14:26:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:38,836 INFO L480 AbstractCegarLoop]: Abstraction has 29957 states and 69194 transitions. [2018-12-02 14:26:38,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29957 states and 69194 transitions. [2018-12-02 14:26:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 14:26:38,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:38,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:38,860 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:38,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash -908801281, now seen corresponding path program 1 times [2018-12-02 14:26:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:38,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:38,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:26:38,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:38,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:26:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:26:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:26:38,945 INFO L87 Difference]: Start difference. First operand 29957 states and 69194 transitions. Second operand 6 states. [2018-12-02 14:26:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:39,080 INFO L93 Difference]: Finished difference Result 29813 states and 68610 transitions. [2018-12-02 14:26:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:26:39,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 14:26:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:39,100 INFO L225 Difference]: With dead ends: 29813 [2018-12-02 14:26:39,100 INFO L226 Difference]: Without dead ends: 29813 [2018-12-02 14:26:39,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:26:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29813 states. [2018-12-02 14:26:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29813 to 26218. [2018-12-02 14:26:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26218 states. [2018-12-02 14:26:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26218 states to 26218 states and 60485 transitions. [2018-12-02 14:26:39,341 INFO L78 Accepts]: Start accepts. Automaton has 26218 states and 60485 transitions. Word has length 113 [2018-12-02 14:26:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:39,341 INFO L480 AbstractCegarLoop]: Abstraction has 26218 states and 60485 transitions. [2018-12-02 14:26:39,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:26:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26218 states and 60485 transitions. [2018-12-02 14:26:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 14:26:39,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:39,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:39,360 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:39,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1192133241, now seen corresponding path program 1 times [2018-12-02 14:26:39,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:39,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:39,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:26:39,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:39,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:26:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:26:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:26:39,408 INFO L87 Difference]: Start difference. First operand 26218 states and 60485 transitions. Second operand 6 states. [2018-12-02 14:26:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:39,685 INFO L93 Difference]: Finished difference Result 30105 states and 68774 transitions. [2018-12-02 14:26:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:26:39,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 14:26:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:39,706 INFO L225 Difference]: With dead ends: 30105 [2018-12-02 14:26:39,706 INFO L226 Difference]: Without dead ends: 30085 [2018-12-02 14:26:39,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:26:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30085 states. [2018-12-02 14:26:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30085 to 26300. [2018-12-02 14:26:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26300 states. [2018-12-02 14:26:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26300 states to 26300 states and 60651 transitions. [2018-12-02 14:26:39,936 INFO L78 Accepts]: Start accepts. Automaton has 26300 states and 60651 transitions. Word has length 113 [2018-12-02 14:26:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:39,936 INFO L480 AbstractCegarLoop]: Abstraction has 26300 states and 60651 transitions. [2018-12-02 14:26:39,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:26:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 26300 states and 60651 transitions. [2018-12-02 14:26:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 14:26:39,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:39,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:39,954 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:39,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1354587686, now seen corresponding path program 1 times [2018-12-02 14:26:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:39,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:40,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:40,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:40,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:40,026 INFO L87 Difference]: Start difference. First operand 26300 states and 60651 transitions. Second operand 7 states. [2018-12-02 14:26:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:40,354 INFO L93 Difference]: Finished difference Result 33621 states and 76026 transitions. [2018-12-02 14:26:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:26:40,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 14:26:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:40,377 INFO L225 Difference]: With dead ends: 33621 [2018-12-02 14:26:40,377 INFO L226 Difference]: Without dead ends: 33621 [2018-12-02 14:26:40,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:26:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33621 states. [2018-12-02 14:26:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33621 to 29239. [2018-12-02 14:26:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29239 states. [2018-12-02 14:26:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29239 states to 29239 states and 66611 transitions. [2018-12-02 14:26:40,688 INFO L78 Accepts]: Start accepts. Automaton has 29239 states and 66611 transitions. Word has length 115 [2018-12-02 14:26:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:40,688 INFO L480 AbstractCegarLoop]: Abstraction has 29239 states and 66611 transitions. [2018-12-02 14:26:40,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29239 states and 66611 transitions. [2018-12-02 14:26:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 14:26:40,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:40,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:40,713 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:40,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1565938599, now seen corresponding path program 1 times [2018-12-02 14:26:40,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:40,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:40,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:26:40,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:40,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:26:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:26:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:26:40,816 INFO L87 Difference]: Start difference. First operand 29239 states and 66611 transitions. Second operand 7 states. [2018-12-02 14:26:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:41,011 INFO L93 Difference]: Finished difference Result 30241 states and 68789 transitions. [2018-12-02 14:26:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:26:41,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 14:26:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:41,034 INFO L225 Difference]: With dead ends: 30241 [2018-12-02 14:26:41,035 INFO L226 Difference]: Without dead ends: 30241 [2018-12-02 14:26:41,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:26:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30241 states. [2018-12-02 14:26:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30241 to 29660. [2018-12-02 14:26:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29660 states. [2018-12-02 14:26:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29660 states to 29660 states and 67596 transitions. [2018-12-02 14:26:41,301 INFO L78 Accepts]: Start accepts. Automaton has 29660 states and 67596 transitions. Word has length 115 [2018-12-02 14:26:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:41,301 INFO L480 AbstractCegarLoop]: Abstraction has 29660 states and 67596 transitions. [2018-12-02 14:26:41,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:26:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29660 states and 67596 transitions. [2018-12-02 14:26:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 14:26:41,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:41,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:41,324 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:41,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1841525016, now seen corresponding path program 1 times [2018-12-02 14:26:41,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:41,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:41,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:26:41,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:41,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:26:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:26:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:41,356 INFO L87 Difference]: Start difference. First operand 29660 states and 67596 transitions. Second operand 3 states. [2018-12-02 14:26:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:41,425 INFO L93 Difference]: Finished difference Result 37261 states and 84329 transitions. [2018-12-02 14:26:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:26:41,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-02 14:26:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:41,452 INFO L225 Difference]: With dead ends: 37261 [2018-12-02 14:26:41,453 INFO L226 Difference]: Without dead ends: 37261 [2018-12-02 14:26:41,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:26:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37261 states. [2018-12-02 14:26:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37261 to 36938. [2018-12-02 14:26:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36938 states. [2018-12-02 14:26:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36938 states to 36938 states and 83624 transitions. [2018-12-02 14:26:41,753 INFO L78 Accepts]: Start accepts. Automaton has 36938 states and 83624 transitions. Word has length 115 [2018-12-02 14:26:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:41,753 INFO L480 AbstractCegarLoop]: Abstraction has 36938 states and 83624 transitions. [2018-12-02 14:26:41,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:26:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 36938 states and 83624 transitions. [2018-12-02 14:26:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 14:26:41,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:41,779 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:41,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash -116044119, now seen corresponding path program 1 times [2018-12-02 14:26:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:41,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:26:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:41,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:26:41,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:26:41,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:26:41,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:26:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:26:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:26:41,859 INFO L87 Difference]: Start difference. First operand 36938 states and 83624 transitions. Second operand 9 states. [2018-12-02 14:26:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:42,032 INFO L93 Difference]: Finished difference Result 39889 states and 90628 transitions. [2018-12-02 14:26:42,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:26:42,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-12-02 14:26:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:42,036 INFO L225 Difference]: With dead ends: 39889 [2018-12-02 14:26:42,036 INFO L226 Difference]: Without dead ends: 5748 [2018-12-02 14:26:42,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:26:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2018-12-02 14:26:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 5748. [2018-12-02 14:26:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5748 states. [2018-12-02 14:26:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 13303 transitions. [2018-12-02 14:26:42,075 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 13303 transitions. Word has length 115 [2018-12-02 14:26:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:42,076 INFO L480 AbstractCegarLoop]: Abstraction has 5748 states and 13303 transitions. [2018-12-02 14:26:42,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:26:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 13303 transitions. [2018-12-02 14:26:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 14:26:42,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:26:42,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:26:42,080 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:26:42,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:26:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 2 times [2018-12-02 14:26:42,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:26:42,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:42,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:26:42,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:26:42,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:26:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:26:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:26:42,141 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:26:42,253 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 14:26:42,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:26:42 BasicIcfg [2018-12-02 14:26:42,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:26:42,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:26:42,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:26:42,255 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:26:42,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:58" (3/4) ... [2018-12-02 14:26:42,257 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:26:42,392 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a39fe2f4-20b2-43ec-9c77-3b5c07f65f0d/bin-2019/utaipan/witness.graphml [2018-12-02 14:26:42,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:26:42,393 INFO L168 Benchmark]: Toolchain (without parser) took 44591.52 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 945.9 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 14:26:42,394 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:26:42,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:42,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.51 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:42,395 INFO L168 Benchmark]: Boogie Preprocessor took 20.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:26:42,395 INFO L168 Benchmark]: RCFGBuilder took 403.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:42,395 INFO L168 Benchmark]: TraceAbstraction took 43657.29 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 14:26:42,395 INFO L168 Benchmark]: Witness Printer took 137.60 ms. Allocated memory is still 5.6 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-02 14:26:42,397 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.51 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.36 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 403.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43657.29 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 137.60 ms. Allocated memory is still 5.6 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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] [L681] -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, main$tmp_guard0=0] [L682] -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, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1731; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1731, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1732; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1732, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 43.5s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13146 SDtfs, 14188 SDslu, 30992 SDs, 0 SdLazy, 10540 SolverSat, 691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 81 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104360occurred 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: 18.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 337048 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2663 NumberOfCodeBlocks, 2663 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2518 ConstructedInterpolants, 0 QuantifiedInterpolants, 651620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...