./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.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_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/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 f826e25c8c31c46de95cdece910a51d666dafee4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:43:35,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:43:35,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:43:35,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:43:35,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:43:35,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:43:35,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:43:35,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:43:35,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:43:35,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:43:35,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:43:35,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:43:35,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:43:35,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:43:35,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:43:35,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:43:35,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:43:35,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:43:35,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:43:35,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:43:35,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:43:35,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:43:35,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:43:35,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:43:35,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:43:35,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:43:35,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:43:35,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:43:35,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:43:35,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:43:35,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:43:35,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:43:35,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:43:35,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:43:35,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:43:35,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:43:35,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:43:35,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:43:35,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:43:35,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:43:35,433 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:43:35,433 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:43:35,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:43:35,433 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:43:35,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:43:35,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:43:35,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:43:35,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:43:35,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:43:35,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:43:35,436 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:43:35,436 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_496e364f-58fa-40e6-a79e-6019ebad4577/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 -> f826e25c8c31c46de95cdece910a51d666dafee4 [2018-12-02 05:43:35,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:43:35,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:43:35,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:43:35,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:43:35,466 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:43:35,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-02 05:43:35,510 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/data/255cb25b0/949afaa8b1be47bb944886c50d167ef5/FLAG42dbf63ac [2018-12-02 05:43:35,936 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:43:35,936 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/sv-benchmarks/c/pthread-wmm/rfi008_tso.oepc_false-unreach-call.i [2018-12-02 05:43:35,943 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/data/255cb25b0/949afaa8b1be47bb944886c50d167ef5/FLAG42dbf63ac [2018-12-02 05:43:35,952 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/data/255cb25b0/949afaa8b1be47bb944886c50d167ef5 [2018-12-02 05:43:35,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:43:35,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:43:35,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:43:35,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:43:35,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:43:35,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:43:35" (1/1) ... [2018-12-02 05:43:35,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:35, skipping insertion in model container [2018-12-02 05:43:35,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:43:35" (1/1) ... [2018-12-02 05:43:35,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:43:35,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:43:36,196 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:43:36,204 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:43:36,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:43:36,316 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:43:36,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36 WrapperNode [2018-12-02 05:43:36,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:43:36,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:43:36,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:43:36,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:43:36,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:43:36,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:43:36,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:43:36,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:43:36,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... [2018-12-02 05:43:36,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:43:36,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:43:36,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:43:36,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:43:36,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/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 05:43:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:43:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:43:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 05:43:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:43:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 05:43:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 05:43:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 05:43:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 05:43:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 05:43:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:43:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:43:36,409 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 05:43:36,787 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:43:36,787 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:43:36,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:43:36 BoogieIcfgContainer [2018-12-02 05:43:36,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:43:36,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:43:36,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:43:36,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:43:36,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:43:35" (1/3) ... [2018-12-02 05:43:36,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c61a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:43:36, skipping insertion in model container [2018-12-02 05:43:36,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:43:36" (2/3) ... [2018-12-02 05:43:36,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c61a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:43:36, skipping insertion in model container [2018-12-02 05:43:36,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:43:36" (3/3) ... [2018-12-02 05:43:36,792 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_tso.oepc_false-unreach-call.i [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,834 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,835 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,836 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,837 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,838 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,839 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,840 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,841 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,842 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:43:36,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:43:36,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:43:36,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 05:43:36,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 05:43:36,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:43:36,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:43:36,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:43:36,883 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:43:36,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:43:36,883 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:43:36,884 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:43:36,884 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:43:36,891 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-02 05:43:44,853 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-02 05:43:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-02 05:43:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 05:43:44,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:44,859 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 05:43:44,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:44,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-02 05:43:44,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:44,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:44,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:45,004 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 05:43:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:45,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:45,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:45,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:45,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:45,019 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-02 05:43:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:46,169 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-02 05:43:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:43:46,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 05:43:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:46,609 INFO L225 Difference]: With dead ends: 192000 [2018-12-02 05:43:46,609 INFO L226 Difference]: Without dead ends: 135832 [2018-12-02 05:43:46,610 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 05:43:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-02 05:43:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-02 05:43:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-02 05:43:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-02 05:43:49,411 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-02 05:43:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:49,411 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-02 05:43:49,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-02 05:43:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:43:49,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:49,417 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 05:43:49,417 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:49,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-02 05:43:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:49,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:49,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:49,488 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 05:43:49,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:49,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:49,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:49,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:49,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:49,490 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-02 05:43:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:51,741 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-02 05:43:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:51,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 05:43:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:52,143 INFO L225 Difference]: With dead ends: 195844 [2018-12-02 05:43:52,143 INFO L226 Difference]: Without dead ends: 195292 [2018-12-02 05:43:52,144 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 05:43:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-02 05:43:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-02 05:43:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-02 05:43:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-02 05:43:55,525 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-02 05:43:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:55,526 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-02 05:43:55,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-02 05:43:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:43:55,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:55,530 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 05:43:55,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:55,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:55,531 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-02 05:43:55,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:55,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:55,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:55,577 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 05:43:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:55,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:55,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:55,578 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-02 05:43:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:57,055 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-02 05:43:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:57,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 05:43:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:57,599 INFO L225 Difference]: With dead ends: 253868 [2018-12-02 05:43:57,599 INFO L226 Difference]: Without dead ends: 253356 [2018-12-02 05:43:57,599 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 05:43:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-02 05:44:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-02 05:44:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-02 05:44:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-02 05:44:01,878 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-02 05:44:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:01,878 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-02 05:44:01,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:44:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-02 05:44:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:44:01,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:01,883 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 05:44:01,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:01,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-02 05:44:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:01,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:01,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:01,907 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 05:44:01,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:01,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:44:01,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:44:01,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:44:01,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:44:01,907 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-02 05:44:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:02,976 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-02 05:44:02,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:44:02,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 05:44:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:03,445 INFO L225 Difference]: With dead ends: 234162 [2018-12-02 05:44:03,445 INFO L226 Difference]: Without dead ends: 234162 [2018-12-02 05:44:03,445 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 05:44:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-02 05:44:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-02 05:44:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-02 05:44:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-02 05:44:10,071 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-02 05:44:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:10,071 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-02 05:44:10,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:44:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-02 05:44:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:44:10,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:10,085 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 05:44:10,085 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-02 05:44:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:10,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:10,154 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 05:44:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:10,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:44:10,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:10,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:44:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:44:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:44:10,155 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-02 05:44:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:12,462 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-02 05:44:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:44:12,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 05:44:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:13,296 INFO L225 Difference]: With dead ends: 402833 [2018-12-02 05:44:13,296 INFO L226 Difference]: Without dead ends: 402257 [2018-12-02 05:44:13,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:44:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-02 05:44:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-02 05:44:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-02 05:44:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-02 05:44:22,772 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-02 05:44:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:22,773 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-02 05:44:22,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:44:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-02 05:44:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:44:22,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:22,786 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 05:44:22,786 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:22,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2018-12-02 05:44:22,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:22,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:22,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:22,842 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 05:44:22,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:22,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:22,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:22,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:22,843 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-02 05:44:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:24,677 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-02 05:44:24,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:44:24,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-02 05:44:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:25,364 INFO L225 Difference]: With dead ends: 325852 [2018-12-02 05:44:25,364 INFO L226 Difference]: Without dead ends: 325852 [2018-12-02 05:44:25,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:44:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-02 05:44:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-02 05:44:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-02 05:44:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-02 05:44:34,157 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-02 05:44:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-02 05:44:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-02 05:44:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:44:34,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:34,174 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 05:44:34,174 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2018-12-02 05:44:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:34,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:34,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:34,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:34,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:34,221 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 05:44:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:44:34,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:34,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:44:34,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:44:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:44:34,222 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 3 states. [2018-12-02 05:44:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:34,978 INFO L93 Difference]: Finished difference Result 209798 states and 761087 transitions. [2018-12-02 05:44:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:44:34,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-02 05:44:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:35,414 INFO L225 Difference]: With dead ends: 209798 [2018-12-02 05:44:35,414 INFO L226 Difference]: Without dead ends: 209798 [2018-12-02 05:44:35,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:44:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209798 states. [2018-12-02 05:44:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209798 to 207253. [2018-12-02 05:44:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207253 states. [2018-12-02 05:44:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207253 states to 207253 states and 752339 transitions. [2018-12-02 05:44:40,304 INFO L78 Accepts]: Start accepts. Automaton has 207253 states and 752339 transitions. Word has length 54 [2018-12-02 05:44:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:40,305 INFO L480 AbstractCegarLoop]: Abstraction has 207253 states and 752339 transitions. [2018-12-02 05:44:40,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:44:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 207253 states and 752339 transitions. [2018-12-02 05:44:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:44:40,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:40,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:44:40,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:40,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1480801646, now seen corresponding path program 1 times [2018-12-02 05:44:40,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:40,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:40,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:40,353 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 05:44:40,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:40,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:40,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:40,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:40,354 INFO L87 Difference]: Start difference. First operand 207253 states and 752339 transitions. Second operand 4 states. [2018-12-02 05:44:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:40,460 INFO L93 Difference]: Finished difference Result 32822 states and 104262 transitions. [2018-12-02 05:44:40,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:44:40,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 05:44:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:40,492 INFO L225 Difference]: With dead ends: 32822 [2018-12-02 05:44:40,493 INFO L226 Difference]: Without dead ends: 24964 [2018-12-02 05:44:40,493 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 05:44:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2018-12-02 05:44:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24717. [2018-12-02 05:44:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24717 states. [2018-12-02 05:44:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24717 states to 24717 states and 75708 transitions. [2018-12-02 05:44:40,760 INFO L78 Accepts]: Start accepts. Automaton has 24717 states and 75708 transitions. Word has length 55 [2018-12-02 05:44:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:40,760 INFO L480 AbstractCegarLoop]: Abstraction has 24717 states and 75708 transitions. [2018-12-02 05:44:40,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24717 states and 75708 transitions. [2018-12-02 05:44:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:44:40,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:40,763 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 05:44:40,763 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:40,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-02 05:44:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:40,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:40,795 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 05:44:40,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:40,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:40,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:40,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:40,796 INFO L87 Difference]: Start difference. First operand 24717 states and 75708 transitions. Second operand 4 states. [2018-12-02 05:44:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:41,175 INFO L93 Difference]: Finished difference Result 27155 states and 82977 transitions. [2018-12-02 05:44:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:44:41,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 05:44:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:41,209 INFO L225 Difference]: With dead ends: 27155 [2018-12-02 05:44:41,209 INFO L226 Difference]: Without dead ends: 27155 [2018-12-02 05:44:41,209 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 05:44:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27155 states. [2018-12-02 05:44:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27155 to 25562. [2018-12-02 05:44:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2018-12-02 05:44:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 78203 transitions. [2018-12-02 05:44:41,493 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 78203 transitions. Word has length 62 [2018-12-02 05:44:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:41,494 INFO L480 AbstractCegarLoop]: Abstraction has 25562 states and 78203 transitions. [2018-12-02 05:44:41,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 78203 transitions. [2018-12-02 05:44:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:44:41,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:41,497 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 05:44:41,498 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:41,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-02 05:44:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:41,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:41,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:41,543 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 05:44:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:44:41,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:41,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:44:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:44:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:44:41,544 INFO L87 Difference]: Start difference. First operand 25562 states and 78203 transitions. Second operand 6 states. [2018-12-02 05:44:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:42,196 INFO L93 Difference]: Finished difference Result 53444 states and 162274 transitions. [2018-12-02 05:44:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:44:42,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 05:44:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:42,268 INFO L225 Difference]: With dead ends: 53444 [2018-12-02 05:44:42,268 INFO L226 Difference]: Without dead ends: 53373 [2018-12-02 05:44:42,268 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 05:44:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53373 states. [2018-12-02 05:44:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53373 to 32726. [2018-12-02 05:44:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32726 states. [2018-12-02 05:44:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32726 states to 32726 states and 98221 transitions. [2018-12-02 05:44:42,748 INFO L78 Accepts]: Start accepts. Automaton has 32726 states and 98221 transitions. Word has length 62 [2018-12-02 05:44:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:42,748 INFO L480 AbstractCegarLoop]: Abstraction has 32726 states and 98221 transitions. [2018-12-02 05:44:42,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:44:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 32726 states and 98221 transitions. [2018-12-02 05:44:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 05:44:42,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:42,754 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 05:44:42,754 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:42,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-02 05:44:42,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:42,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:42,770 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 05:44:42,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:42,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:44:42,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:42,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:44:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:44:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:44:42,771 INFO L87 Difference]: Start difference. First operand 32726 states and 98221 transitions. Second operand 3 states. [2018-12-02 05:44:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:42,882 INFO L93 Difference]: Finished difference Result 40875 states and 121466 transitions. [2018-12-02 05:44:42,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:44:42,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 05:44:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:42,924 INFO L225 Difference]: With dead ends: 40875 [2018-12-02 05:44:42,924 INFO L226 Difference]: Without dead ends: 40875 [2018-12-02 05:44:42,924 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 05:44:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40875 states. [2018-12-02 05:44:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40875 to 33483. [2018-12-02 05:44:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33483 states. [2018-12-02 05:44:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 98578 transitions. [2018-12-02 05:44:44,068 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 98578 transitions. Word has length 68 [2018-12-02 05:44:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:44,068 INFO L480 AbstractCegarLoop]: Abstraction has 33483 states and 98578 transitions. [2018-12-02 05:44:44,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:44:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 98578 transitions. [2018-12-02 05:44:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:44:44,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:44,076 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 05:44:44,076 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:44,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:44,076 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-02 05:44:44,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:44,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:44,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:44,120 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 05:44:44,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:44,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:44:44,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:44,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:44:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:44:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:44:44,121 INFO L87 Difference]: Start difference. First operand 33483 states and 98578 transitions. Second operand 5 states. [2018-12-02 05:44:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:44,393 INFO L93 Difference]: Finished difference Result 38508 states and 113005 transitions. [2018-12-02 05:44:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:44:44,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-02 05:44:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:44,433 INFO L225 Difference]: With dead ends: 38508 [2018-12-02 05:44:44,434 INFO L226 Difference]: Without dead ends: 38508 [2018-12-02 05:44:44,434 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 05:44:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2018-12-02 05:44:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 36833. [2018-12-02 05:44:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36833 states. [2018-12-02 05:44:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36833 states to 36833 states and 108189 transitions. [2018-12-02 05:44:44,820 INFO L78 Accepts]: Start accepts. Automaton has 36833 states and 108189 transitions. Word has length 74 [2018-12-02 05:44:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:44,821 INFO L480 AbstractCegarLoop]: Abstraction has 36833 states and 108189 transitions. [2018-12-02 05:44:44,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:44:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 36833 states and 108189 transitions. [2018-12-02 05:44:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:44:44,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:44,828 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 05:44:44,829 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:44,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-02 05:44:44,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:44,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:44,884 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 05:44:44,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:44,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:44,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:44,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:44,884 INFO L87 Difference]: Start difference. First operand 36833 states and 108189 transitions. Second operand 7 states. [2018-12-02 05:44:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:45,398 INFO L93 Difference]: Finished difference Result 44363 states and 130601 transitions. [2018-12-02 05:44:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:44:45,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 05:44:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:45,446 INFO L225 Difference]: With dead ends: 44363 [2018-12-02 05:44:45,446 INFO L226 Difference]: Without dead ends: 44276 [2018-12-02 05:44:45,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 05:44:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44276 states. [2018-12-02 05:44:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44276 to 33054. [2018-12-02 05:44:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33054 states. [2018-12-02 05:44:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 98260 transitions. [2018-12-02 05:44:45,845 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 98260 transitions. Word has length 74 [2018-12-02 05:44:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 33054 states and 98260 transitions. [2018-12-02 05:44:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 98260 transitions. [2018-12-02 05:44:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 05:44:45,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:45,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:44:45,853 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:45,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-02 05:44:45,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:45,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:45,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:45,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:45,896 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 05:44:45,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:45,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:45,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:45,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:45,897 INFO L87 Difference]: Start difference. First operand 33054 states and 98260 transitions. Second operand 7 states. [2018-12-02 05:44:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:46,604 INFO L93 Difference]: Finished difference Result 73264 states and 216100 transitions. [2018-12-02 05:44:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:44:46,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-02 05:44:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:46,687 INFO L225 Difference]: With dead ends: 73264 [2018-12-02 05:44:46,687 INFO L226 Difference]: Without dead ends: 73200 [2018-12-02 05:44:46,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:44:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2018-12-02 05:44:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 42473. [2018-12-02 05:44:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42473 states. [2018-12-02 05:44:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42473 states to 42473 states and 124402 transitions. [2018-12-02 05:44:47,280 INFO L78 Accepts]: Start accepts. Automaton has 42473 states and 124402 transitions. Word has length 76 [2018-12-02 05:44:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:47,280 INFO L480 AbstractCegarLoop]: Abstraction has 42473 states and 124402 transitions. [2018-12-02 05:44:47,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 42473 states and 124402 transitions. [2018-12-02 05:44:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 05:44:47,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:47,296 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 05:44:47,296 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:47,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:47,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1045447395, now seen corresponding path program 1 times [2018-12-02 05:44:47,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:47,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:47,348 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 05:44:47,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:47,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:47,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:47,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:47,349 INFO L87 Difference]: Start difference. First operand 42473 states and 124402 transitions. Second operand 4 states. [2018-12-02 05:44:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:47,515 INFO L93 Difference]: Finished difference Result 47450 states and 136404 transitions. [2018-12-02 05:44:47,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:44:47,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 05:44:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:47,567 INFO L225 Difference]: With dead ends: 47450 [2018-12-02 05:44:47,567 INFO L226 Difference]: Without dead ends: 47450 [2018-12-02 05:44:47,568 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 05:44:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47450 states. [2018-12-02 05:44:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47450 to 43792. [2018-12-02 05:44:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43792 states. [2018-12-02 05:44:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43792 states to 43792 states and 125556 transitions. [2018-12-02 05:44:48,027 INFO L78 Accepts]: Start accepts. Automaton has 43792 states and 125556 transitions. Word has length 83 [2018-12-02 05:44:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:48,027 INFO L480 AbstractCegarLoop]: Abstraction has 43792 states and 125556 transitions. [2018-12-02 05:44:48,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43792 states and 125556 transitions. [2018-12-02 05:44:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 05:44:48,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:48,042 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] [2018-12-02 05:44:48,043 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:48,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1366691952, now seen corresponding path program 1 times [2018-12-02 05:44:48,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:48,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:48,080 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 05:44:48,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:48,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:48,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:48,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:48,081 INFO L87 Difference]: Start difference. First operand 43792 states and 125556 transitions. Second operand 4 states. [2018-12-02 05:44:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:48,564 INFO L93 Difference]: Finished difference Result 51886 states and 146275 transitions. [2018-12-02 05:44:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:44:48,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-02 05:44:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:48,615 INFO L225 Difference]: With dead ends: 51886 [2018-12-02 05:44:48,615 INFO L226 Difference]: Without dead ends: 51886 [2018-12-02 05:44:48,615 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 05:44:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2018-12-02 05:44:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 49652. [2018-12-02 05:44:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49652 states. [2018-12-02 05:44:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49652 states to 49652 states and 140792 transitions. [2018-12-02 05:44:49,117 INFO L78 Accepts]: Start accepts. Automaton has 49652 states and 140792 transitions. Word has length 84 [2018-12-02 05:44:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:49,117 INFO L480 AbstractCegarLoop]: Abstraction has 49652 states and 140792 transitions. [2018-12-02 05:44:49,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 49652 states and 140792 transitions. [2018-12-02 05:44:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 05:44:49,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:49,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:44:49,133 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:49,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 851066001, now seen corresponding path program 1 times [2018-12-02 05:44:49,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:49,168 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 05:44:49,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:49,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:44:49,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:49,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:44:49,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:44:49,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:44:49,169 INFO L87 Difference]: Start difference. First operand 49652 states and 140792 transitions. Second operand 5 states. [2018-12-02 05:44:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:49,233 INFO L93 Difference]: Finished difference Result 22000 states and 53993 transitions. [2018-12-02 05:44:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:44:49,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-12-02 05:44:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:49,248 INFO L225 Difference]: With dead ends: 22000 [2018-12-02 05:44:49,248 INFO L226 Difference]: Without dead ends: 20041 [2018-12-02 05:44:49,248 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 05:44:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20041 states. [2018-12-02 05:44:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20041 to 16787. [2018-12-02 05:44:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16787 states. [2018-12-02 05:44:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 41093 transitions. [2018-12-02 05:44:49,393 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 41093 transitions. Word has length 84 [2018-12-02 05:44:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:49,393 INFO L480 AbstractCegarLoop]: Abstraction has 16787 states and 41093 transitions. [2018-12-02 05:44:49,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:44:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 41093 transitions. [2018-12-02 05:44:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:49,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:49,404 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 05:44:49,404 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:49,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash -952932386, now seen corresponding path program 1 times [2018-12-02 05:44:49,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:49,457 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 05:44:49,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:49,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:44:49,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:49,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:44:49,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:44:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:44:49,458 INFO L87 Difference]: Start difference. First operand 16787 states and 41093 transitions. Second operand 5 states. [2018-12-02 05:44:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:49,566 INFO L93 Difference]: Finished difference Result 19597 states and 47367 transitions. [2018-12-02 05:44:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:44:49,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-02 05:44:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:49,580 INFO L225 Difference]: With dead ends: 19597 [2018-12-02 05:44:49,580 INFO L226 Difference]: Without dead ends: 19597 [2018-12-02 05:44:49,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2018-12-02 05:44:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 15476. [2018-12-02 05:44:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2018-12-02 05:44:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 37384 transitions. [2018-12-02 05:44:49,720 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 37384 transitions. Word has length 113 [2018-12-02 05:44:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:49,720 INFO L480 AbstractCegarLoop]: Abstraction has 15476 states and 37384 transitions. [2018-12-02 05:44:49,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:44:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 37384 transitions. [2018-12-02 05:44:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:49,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:49,731 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 05:44:49,731 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:49,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1408837945, now seen corresponding path program 1 times [2018-12-02 05:44:49,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:49,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:49,766 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 05:44:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:49,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:44:49,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:49,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:44:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:44:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:44:49,767 INFO L87 Difference]: Start difference. First operand 15476 states and 37384 transitions. Second operand 5 states. [2018-12-02 05:44:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:50,084 INFO L93 Difference]: Finished difference Result 18394 states and 44376 transitions. [2018-12-02 05:44:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:44:50,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-02 05:44:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:50,097 INFO L225 Difference]: With dead ends: 18394 [2018-12-02 05:44:50,097 INFO L226 Difference]: Without dead ends: 18380 [2018-12-02 05:44:50,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-02 05:44:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16712. [2018-12-02 05:44:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2018-12-02 05:44:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 40590 transitions. [2018-12-02 05:44:50,243 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 40590 transitions. Word has length 113 [2018-12-02 05:44:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:50,243 INFO L480 AbstractCegarLoop]: Abstraction has 16712 states and 40590 transitions. [2018-12-02 05:44:50,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:44:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 40590 transitions. [2018-12-02 05:44:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:50,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:50,255 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 05:44:50,255 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:50,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1924515334, now seen corresponding path program 1 times [2018-12-02 05:44:50,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:50,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:50,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:50,439 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 05:44:50,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:50,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:44:50,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:50,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:44:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:44:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:44:50,439 INFO L87 Difference]: Start difference. First operand 16712 states and 40590 transitions. Second operand 10 states. [2018-12-02 05:44:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:51,587 INFO L93 Difference]: Finished difference Result 22401 states and 53117 transitions. [2018-12-02 05:44:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:44:51,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-02 05:44:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:51,613 INFO L225 Difference]: With dead ends: 22401 [2018-12-02 05:44:51,613 INFO L226 Difference]: Without dead ends: 22401 [2018-12-02 05:44:51,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:44:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2018-12-02 05:44:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 19720. [2018-12-02 05:44:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19720 states. [2018-12-02 05:44:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 47091 transitions. [2018-12-02 05:44:51,789 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 47091 transitions. Word has length 113 [2018-12-02 05:44:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 19720 states and 47091 transitions. [2018-12-02 05:44:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:44:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 47091 transitions. [2018-12-02 05:44:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:51,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:51,804 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 05:44:51,804 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:51,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash -850123970, now seen corresponding path program 1 times [2018-12-02 05:44:51,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:51,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:51,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:51,848 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 05:44:51,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:51,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:51,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:51,849 INFO L87 Difference]: Start difference. First operand 19720 states and 47091 transitions. Second operand 4 states. [2018-12-02 05:44:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:51,991 INFO L93 Difference]: Finished difference Result 21561 states and 51172 transitions. [2018-12-02 05:44:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:44:51,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 05:44:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:52,011 INFO L225 Difference]: With dead ends: 21561 [2018-12-02 05:44:52,011 INFO L226 Difference]: Without dead ends: 21541 [2018-12-02 05:44:52,011 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 05:44:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21541 states. [2018-12-02 05:44:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21541 to 20695. [2018-12-02 05:44:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20695 states. [2018-12-02 05:44:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20695 states to 20695 states and 49276 transitions. [2018-12-02 05:44:52,191 INFO L78 Accepts]: Start accepts. Automaton has 20695 states and 49276 transitions. Word has length 113 [2018-12-02 05:44:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:52,191 INFO L480 AbstractCegarLoop]: Abstraction has 20695 states and 49276 transitions. [2018-12-02 05:44:52,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20695 states and 49276 transitions. [2018-12-02 05:44:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:52,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:52,207 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 05:44:52,207 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:52,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 394640511, now seen corresponding path program 1 times [2018-12-02 05:44:52,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:52,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:52,289 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 05:44:52,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:52,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:52,290 INFO L87 Difference]: Start difference. First operand 20695 states and 49276 transitions. Second operand 7 states. [2018-12-02 05:44:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:52,829 INFO L93 Difference]: Finished difference Result 29916 states and 69381 transitions. [2018-12-02 05:44:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:44:52,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 05:44:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:52,852 INFO L225 Difference]: With dead ends: 29916 [2018-12-02 05:44:52,852 INFO L226 Difference]: Without dead ends: 29895 [2018-12-02 05:44:52,852 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 05:44:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29895 states. [2018-12-02 05:44:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29895 to 25757. [2018-12-02 05:44:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25757 states. [2018-12-02 05:44:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25757 states to 25757 states and 59989 transitions. [2018-12-02 05:44:53,108 INFO L78 Accepts]: Start accepts. Automaton has 25757 states and 59989 transitions. Word has length 113 [2018-12-02 05:44:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:53,108 INFO L480 AbstractCegarLoop]: Abstraction has 25757 states and 59989 transitions. [2018-12-02 05:44:53,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25757 states and 59989 transitions. [2018-12-02 05:44:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:53,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:53,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:44:53,129 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:53,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1682568832, now seen corresponding path program 1 times [2018-12-02 05:44:53,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:53,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:53,211 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 05:44:53,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:53,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:44:53,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:53,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:44:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:44:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:44:53,212 INFO L87 Difference]: Start difference. First operand 25757 states and 59989 transitions. Second operand 8 states. [2018-12-02 05:44:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:54,272 INFO L93 Difference]: Finished difference Result 31423 states and 72868 transitions. [2018-12-02 05:44:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 05:44:54,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-02 05:44:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:54,295 INFO L225 Difference]: With dead ends: 31423 [2018-12-02 05:44:54,295 INFO L226 Difference]: Without dead ends: 31423 [2018-12-02 05:44:54,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:44:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31423 states. [2018-12-02 05:44:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31423 to 28451. [2018-12-02 05:44:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28451 states. [2018-12-02 05:44:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28451 states to 28451 states and 66352 transitions. [2018-12-02 05:44:54,572 INFO L78 Accepts]: Start accepts. Automaton has 28451 states and 66352 transitions. Word has length 113 [2018-12-02 05:44:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:54,573 INFO L480 AbstractCegarLoop]: Abstraction has 28451 states and 66352 transitions. [2018-12-02 05:44:54,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:44:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 28451 states and 66352 transitions. [2018-12-02 05:44:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:54,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:54,593 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 05:44:54,593 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:54,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1471217919, now seen corresponding path program 1 times [2018-12-02 05:44:54,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:54,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:54,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:54,622 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 05:44:54,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:54,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:44:54,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:54,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:44:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:44:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:44:54,623 INFO L87 Difference]: Start difference. First operand 28451 states and 66352 transitions. Second operand 3 states. [2018-12-02 05:44:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:54,693 INFO L93 Difference]: Finished difference Result 36935 states and 85774 transitions. [2018-12-02 05:44:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:44:54,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-02 05:44:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:54,723 INFO L225 Difference]: With dead ends: 36935 [2018-12-02 05:44:54,723 INFO L226 Difference]: Without dead ends: 36935 [2018-12-02 05:44:54,723 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 05:44:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36935 states. [2018-12-02 05:44:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36935 to 36568. [2018-12-02 05:44:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36568 states. [2018-12-02 05:44:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36568 states to 36568 states and 84950 transitions. [2018-12-02 05:44:55,036 INFO L78 Accepts]: Start accepts. Automaton has 36568 states and 84950 transitions. Word has length 113 [2018-12-02 05:44:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:55,036 INFO L480 AbstractCegarLoop]: Abstraction has 36568 states and 84950 transitions. [2018-12-02 05:44:55,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:44:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36568 states and 84950 transitions. [2018-12-02 05:44:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:55,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:55,063 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 05:44:55,063 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:55,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1347144672, now seen corresponding path program 1 times [2018-12-02 05:44:55,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:55,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:44:55,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:55,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:55,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:55,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:55,151 INFO L87 Difference]: Start difference. First operand 36568 states and 84950 transitions. Second operand 7 states. [2018-12-02 05:44:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:55,351 INFO L93 Difference]: Finished difference Result 38056 states and 88092 transitions. [2018-12-02 05:44:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:44:55,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 05:44:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:55,379 INFO L225 Difference]: With dead ends: 38056 [2018-12-02 05:44:55,380 INFO L226 Difference]: Without dead ends: 38056 [2018-12-02 05:44:55,380 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 05:44:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38056 states. [2018-12-02 05:44:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38056 to 36984. [2018-12-02 05:44:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36984 states. [2018-12-02 05:44:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36984 states to 36984 states and 85893 transitions. [2018-12-02 05:44:55,697 INFO L78 Accepts]: Start accepts. Automaton has 36984 states and 85893 transitions. Word has length 113 [2018-12-02 05:44:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:55,698 INFO L480 AbstractCegarLoop]: Abstraction has 36984 states and 85893 transitions. [2018-12-02 05:44:55,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36984 states and 85893 transitions. [2018-12-02 05:44:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:55,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:55,724 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 05:44:55,724 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:55,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -459640991, now seen corresponding path program 1 times [2018-12-02 05:44:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:55,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:55,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:55,794 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 05:44:55,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:55,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:55,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:55,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:55,795 INFO L87 Difference]: Start difference. First operand 36984 states and 85893 transitions. Second operand 7 states. [2018-12-02 05:44:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:55,950 INFO L93 Difference]: Finished difference Result 41640 states and 95502 transitions. [2018-12-02 05:44:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:44:55,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 05:44:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:55,983 INFO L225 Difference]: With dead ends: 41640 [2018-12-02 05:44:55,984 INFO L226 Difference]: Without dead ends: 41640 [2018-12-02 05:44:55,984 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 05:44:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41640 states. [2018-12-02 05:44:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41640 to 34916. [2018-12-02 05:44:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34916 states. [2018-12-02 05:44:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34916 states to 34916 states and 80709 transitions. [2018-12-02 05:44:56,323 INFO L78 Accepts]: Start accepts. Automaton has 34916 states and 80709 transitions. Word has length 113 [2018-12-02 05:44:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:56,324 INFO L480 AbstractCegarLoop]: Abstraction has 34916 states and 80709 transitions. [2018-12-02 05:44:56,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34916 states and 80709 transitions. [2018-12-02 05:44:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:56,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:56,401 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 05:44:56,401 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:56,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -659675777, now seen corresponding path program 1 times [2018-12-02 05:44:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:56,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:56,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:56,471 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 05:44:56,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:56,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:44:56,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:56,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:44:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:44:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:44:56,472 INFO L87 Difference]: Start difference. First operand 34916 states and 80709 transitions. Second operand 7 states. [2018-12-02 05:44:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:56,805 INFO L93 Difference]: Finished difference Result 44220 states and 100049 transitions. [2018-12-02 05:44:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:44:56,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 05:44:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:56,839 INFO L225 Difference]: With dead ends: 44220 [2018-12-02 05:44:56,839 INFO L226 Difference]: Without dead ends: 44220 [2018-12-02 05:44:56,839 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 05:44:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44220 states. [2018-12-02 05:44:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44220 to 37036. [2018-12-02 05:44:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37036 states. [2018-12-02 05:44:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37036 states to 37036 states and 84570 transitions. [2018-12-02 05:44:57,196 INFO L78 Accepts]: Start accepts. Automaton has 37036 states and 84570 transitions. Word has length 113 [2018-12-02 05:44:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:57,196 INFO L480 AbstractCegarLoop]: Abstraction has 37036 states and 84570 transitions. [2018-12-02 05:44:57,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:44:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37036 states and 84570 transitions. [2018-12-02 05:44:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:57,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:57,223 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 05:44:57,223 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:57,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash -448324864, now seen corresponding path program 1 times [2018-12-02 05:44:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:57,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:57,272 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 05:44:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:44:57,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:44:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:44:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:57,272 INFO L87 Difference]: Start difference. First operand 37036 states and 84570 transitions. Second operand 4 states. [2018-12-02 05:44:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:57,494 INFO L93 Difference]: Finished difference Result 44716 states and 102080 transitions. [2018-12-02 05:44:57,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:44:57,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 05:44:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:57,530 INFO L225 Difference]: With dead ends: 44716 [2018-12-02 05:44:57,530 INFO L226 Difference]: Without dead ends: 44716 [2018-12-02 05:44:57,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:44:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44716 states. [2018-12-02 05:44:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44716 to 36141. [2018-12-02 05:44:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36141 states. [2018-12-02 05:44:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36141 states to 36141 states and 82643 transitions. [2018-12-02 05:44:57,875 INFO L78 Accepts]: Start accepts. Automaton has 36141 states and 82643 transitions. Word has length 113 [2018-12-02 05:44:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:57,875 INFO L480 AbstractCegarLoop]: Abstraction has 36141 states and 82643 transitions. [2018-12-02 05:44:57,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:44:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 36141 states and 82643 transitions. [2018-12-02 05:44:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:57,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:57,901 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 05:44:57,901 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:57,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1840043908, now seen corresponding path program 1 times [2018-12-02 05:44:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:57,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:57,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:57,985 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 05:44:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:57,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:44:57,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:57,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:44:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:44:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:44:57,986 INFO L87 Difference]: Start difference. First operand 36141 states and 82643 transitions. Second operand 8 states. [2018-12-02 05:44:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:58,360 INFO L93 Difference]: Finished difference Result 42917 states and 97483 transitions. [2018-12-02 05:44:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:44:58,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-02 05:44:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:58,392 INFO L225 Difference]: With dead ends: 42917 [2018-12-02 05:44:58,392 INFO L226 Difference]: Without dead ends: 42917 [2018-12-02 05:44:58,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:44:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42917 states. [2018-12-02 05:44:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42917 to 37882. [2018-12-02 05:44:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37882 states. [2018-12-02 05:44:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37882 states to 37882 states and 86444 transitions. [2018-12-02 05:44:58,779 INFO L78 Accepts]: Start accepts. Automaton has 37882 states and 86444 transitions. Word has length 113 [2018-12-02 05:44:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 37882 states and 86444 transitions. [2018-12-02 05:44:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:44:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37882 states and 86444 transitions. [2018-12-02 05:44:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:58,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:58,803 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 05:44:58,803 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:58,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1690036726, now seen corresponding path program 2 times [2018-12-02 05:44:58,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:58,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:44:58,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:58,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:58,872 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 05:44:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:44:58,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:58,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:44:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:44:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:44:58,873 INFO L87 Difference]: Start difference. First operand 37882 states and 86444 transitions. Second operand 8 states. [2018-12-02 05:44:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:44:59,275 INFO L93 Difference]: Finished difference Result 45739 states and 103987 transitions. [2018-12-02 05:44:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:44:59,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-02 05:44:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:44:59,310 INFO L225 Difference]: With dead ends: 45739 [2018-12-02 05:44:59,310 INFO L226 Difference]: Without dead ends: 45739 [2018-12-02 05:44:59,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:44:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45739 states. [2018-12-02 05:44:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45739 to 36599. [2018-12-02 05:44:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36599 states. [2018-12-02 05:44:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36599 states to 36599 states and 83591 transitions. [2018-12-02 05:44:59,661 INFO L78 Accepts]: Start accepts. Automaton has 36599 states and 83591 transitions. Word has length 113 [2018-12-02 05:44:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:44:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 36599 states and 83591 transitions. [2018-12-02 05:44:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:44:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36599 states and 83591 transitions. [2018-12-02 05:44:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:44:59,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:44:59,687 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 05:44:59,687 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:44:59,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:44:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2008232095, now seen corresponding path program 1 times [2018-12-02 05:44:59,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:44:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:59,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:44:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:44:59,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:44:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:44:59,765 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 05:44:59,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:44:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:44:59,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:44:59,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:44:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:44:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:44:59,765 INFO L87 Difference]: Start difference. First operand 36599 states and 83591 transitions. Second operand 8 states. [2018-12-02 05:45:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:45:00,297 INFO L93 Difference]: Finished difference Result 51006 states and 116580 transitions. [2018-12-02 05:45:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:45:00,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-02 05:45:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:45:00,340 INFO L225 Difference]: With dead ends: 51006 [2018-12-02 05:45:00,340 INFO L226 Difference]: Without dead ends: 51006 [2018-12-02 05:45:00,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:45:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51006 states. [2018-12-02 05:45:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51006 to 36519. [2018-12-02 05:45:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36519 states. [2018-12-02 05:45:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36519 states to 36519 states and 83389 transitions. [2018-12-02 05:45:00,718 INFO L78 Accepts]: Start accepts. Automaton has 36519 states and 83389 transitions. Word has length 113 [2018-12-02 05:45:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:45:00,719 INFO L480 AbstractCegarLoop]: Abstraction has 36519 states and 83389 transitions. [2018-12-02 05:45:00,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:45:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36519 states and 83389 transitions. [2018-12-02 05:45:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 05:45:00,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:45:00,745 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 05:45:00,745 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:45:00,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:45:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1632202250, now seen corresponding path program 3 times [2018-12-02 05:45:00,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:45:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:00,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:45:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:00,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:45:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:45:00,794 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 05:45:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:45:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:45:00,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:45:00,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:45:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:45:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:45:00,795 INFO L87 Difference]: Start difference. First operand 36519 states and 83389 transitions. Second operand 6 states. [2018-12-02 05:45:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:45:01,085 INFO L93 Difference]: Finished difference Result 41825 states and 94466 transitions. [2018-12-02 05:45:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:45:01,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 05:45:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:45:01,117 INFO L225 Difference]: With dead ends: 41825 [2018-12-02 05:45:01,117 INFO L226 Difference]: Without dead ends: 41805 [2018-12-02 05:45:01,117 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 05:45:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41805 states. [2018-12-02 05:45:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41805 to 37032. [2018-12-02 05:45:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37032 states. [2018-12-02 05:45:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37032 states to 37032 states and 84440 transitions. [2018-12-02 05:45:01,476 INFO L78 Accepts]: Start accepts. Automaton has 37032 states and 84440 transitions. Word has length 113 [2018-12-02 05:45:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:45:01,476 INFO L480 AbstractCegarLoop]: Abstraction has 37032 states and 84440 transitions. [2018-12-02 05:45:01,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:45:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37032 states and 84440 transitions. [2018-12-02 05:45:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 05:45:01,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:45:01,501 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 05:45:01,501 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:45:01,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:45:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash -116044119, now seen corresponding path program 1 times [2018-12-02 05:45:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:45:01,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:01,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:45:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:01,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:45:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:45:01,602 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 05:45:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:45:01,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:45:01,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:45:01,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:45:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:45:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:45:01,603 INFO L87 Difference]: Start difference. First operand 37032 states and 84440 transitions. Second operand 9 states. [2018-12-02 05:45:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:45:01,841 INFO L93 Difference]: Finished difference Result 63323 states and 145246 transitions. [2018-12-02 05:45:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:45:01,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-12-02 05:45:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:45:01,846 INFO L225 Difference]: With dead ends: 63323 [2018-12-02 05:45:01,847 INFO L226 Difference]: Without dead ends: 6981 [2018-12-02 05:45:01,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:45:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2018-12-02 05:45:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6981. [2018-12-02 05:45:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2018-12-02 05:45:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 16457 transitions. [2018-12-02 05:45:01,893 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 16457 transitions. Word has length 115 [2018-12-02 05:45:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:45:01,893 INFO L480 AbstractCegarLoop]: Abstraction has 6981 states and 16457 transitions. [2018-12-02 05:45:01,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:45:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 16457 transitions. [2018-12-02 05:45:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 05:45:01,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:45:01,897 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 05:45:01,897 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:45:01,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:45:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 1 times [2018-12-02 05:45:01,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:45:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:01,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:45:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:45:01,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:45:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:45:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:45:01,946 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:45:02,048 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:45:02,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:45:02 BasicIcfg [2018-12-02 05:45:02,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:45:02,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:45:02,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:45:02,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:45:02,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:43:36" (3/4) ... [2018-12-02 05:45:02,051 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:45:02,147 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_496e364f-58fa-40e6-a79e-6019ebad4577/bin-2019/utaipan/witness.graphml [2018-12-02 05:45:02,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:45:02,148 INFO L168 Benchmark]: Toolchain (without parser) took 86193.80 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 947.0 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,149 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:45:02,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,150 INFO L168 Benchmark]: Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,150 INFO L168 Benchmark]: RCFGBuilder took 415.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,151 INFO L168 Benchmark]: TraceAbstraction took 85260.62 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 999.7 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 925.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,151 INFO L168 Benchmark]: Witness Printer took 98.54 ms. Allocated memory is still 6.4 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:45:02,152 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 415.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85260.62 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 999.7 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 925.9 MB. Max. memory is 11.5 GB. * Witness Printer took 98.54 ms. Allocated memory is still 6.4 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [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 t1735; 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(&t1735, ((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 t1736; 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(&t1736, ((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, 85.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 25.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14016 SDtfs, 16665 SDslu, 32283 SDs, 0 SdLazy, 11873 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 87 SyntacticMatches, 32 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 49.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 697045 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2989 NumberOfCodeBlocks, 2989 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2841 ConstructedInterpolants, 0 QuantifiedInterpolants, 789295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...