./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_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_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/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 c88656182442dc130c6177960ddd26b8e0100871 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 19:19:08,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:19:08,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:19:08,492 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:19:08,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:19:08,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:19:08,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:19:08,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:19:08,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:19:08,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:19:08,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:19:08,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:19:08,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:19:08,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:19:08,498 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:19:08,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:19:08,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:19:08,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:19:08,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:19:08,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:19:08,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:19:08,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:19:08,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:19:08,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:19:08,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:19:08,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:19:08,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:19:08,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:19:08,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:19:08,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:19:08,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:19:08,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:19:08,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:19:08,507 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:19:08,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:19:08,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:19:08,508 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:19:08,516 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:19:08,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:19:08,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:19:08,517 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:19:08,517 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:19:08,517 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:19:08,517 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:19:08,517 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:19:08,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:19:08,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:19:08,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:19:08,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:19:08,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:19:08,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:19:08,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:19:08,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:19:08,521 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_cf5e3859-d97b-41ee-ba41-8e62f034e33d/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 -> c88656182442dc130c6177960ddd26b8e0100871 [2018-12-08 19:19:08,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:19:08,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:19:08,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:19:08,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:19:08,548 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:19:08,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i [2018-12-08 19:19:08,582 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/data/4f3e11bd3/e4b5d11925c148f8a626991d4d3367b0/FLAGd405175d7 [2018-12-08 19:19:08,998 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:19:08,998 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/sv-benchmarks/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i [2018-12-08 19:19:09,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/data/4f3e11bd3/e4b5d11925c148f8a626991d4d3367b0/FLAGd405175d7 [2018-12-08 19:19:09,338 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/data/4f3e11bd3/e4b5d11925c148f8a626991d4d3367b0 [2018-12-08 19:19:09,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:19:09,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:19:09,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:19:09,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:19:09,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:19:09,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b9a0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09, skipping insertion in model container [2018-12-08 19:19:09,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:19:09,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:19:09,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:19:09,608 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:19:09,690 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:19:09,723 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:19:09,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09 WrapperNode [2018-12-08 19:19:09,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:19:09,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:19:09,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:19:09,724 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:19:09,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:19:09,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:19:09,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:19:09,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:19:09,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... [2018-12-08 19:19:09,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:19:09,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:19:09,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:19:09,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:19:09,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/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-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 19:19:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 19:19:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 19:19:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:19:09,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:19:09,828 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 19:19:10,199 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:19:10,199 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 19:19:10,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:19:10 BoogieIcfgContainer [2018-12-08 19:19:10,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:19:10,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:19:10,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:19:10,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:19:10,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:19:09" (1/3) ... [2018-12-08 19:19:10,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55557f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:19:10, skipping insertion in model container [2018-12-08 19:19:10,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:19:09" (2/3) ... [2018-12-08 19:19:10,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55557f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:19:10, skipping insertion in model container [2018-12-08 19:19:10,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:19:10" (3/3) ... [2018-12-08 19:19:10,204 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_tso.oepc_false-unreach-call.i [2018-12-08 19:19:10,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,241 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:19:10,254 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 19:19:10,254 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:19:10,259 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:19:10,268 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:19:10,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:19:10,283 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:19:10,283 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:19:10,283 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:19:10,283 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:19:10,283 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:19:10,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:19:10,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:19:10,290 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-08 19:19:18,193 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-08 19:19:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-08 19:19:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 19:19:18,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:18,200 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-08 19:19:18,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:18,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2018-12-08 19:19:18,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:18,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:18,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:18,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:18,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:18,341 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-08 19:19:18,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:18,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:18,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:18,357 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-08 19:19:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:19,521 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-08 19:19:19,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:19:19,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-08 19:19:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:19,950 INFO L225 Difference]: With dead ends: 192000 [2018-12-08 19:19:19,950 INFO L226 Difference]: Without dead ends: 135832 [2018-12-08 19:19:19,951 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-08 19:19:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-08 19:19:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-08 19:19:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-08 19:19:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-08 19:19:22,726 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-08 19:19:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:22,726 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-08 19:19:22,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-08 19:19:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 19:19:22,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:22,733 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-08 19:19:22,734 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:22,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2018-12-08 19:19:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:22,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:22,791 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-08 19:19:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:22,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:22,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:22,792 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 4 states. [2018-12-08 19:19:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:22,909 INFO L93 Difference]: Finished difference Result 16846 states and 57032 transitions. [2018-12-08 19:19:22,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:19:22,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 19:19:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:22,930 INFO L225 Difference]: With dead ends: 16846 [2018-12-08 19:19:22,930 INFO L226 Difference]: Without dead ends: 13306 [2018-12-08 19:19:22,931 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-08 19:19:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2018-12-08 19:19:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13306. [2018-12-08 19:19:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2018-12-08 19:19:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 43727 transitions. [2018-12-08 19:19:23,078 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 43727 transitions. Word has length 47 [2018-12-08 19:19:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:23,079 INFO L480 AbstractCegarLoop]: Abstraction has 13306 states and 43727 transitions. [2018-12-08 19:19:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 43727 transitions. [2018-12-08 19:19:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 19:19:23,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:23,080 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-08 19:19:23,080 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:23,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2018-12-08 19:19:23,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:23,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:23,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:23,132 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-08 19:19:23,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:23,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:19:23,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:23,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:19:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:19:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:19:23,133 INFO L87 Difference]: Start difference. First operand 13306 states and 43727 transitions. Second operand 5 states. [2018-12-08 19:19:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:23,432 INFO L93 Difference]: Finished difference Result 25424 states and 82823 transitions. [2018-12-08 19:19:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:19:23,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 19:19:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:23,478 INFO L225 Difference]: With dead ends: 25424 [2018-12-08 19:19:23,479 INFO L226 Difference]: Without dead ends: 25356 [2018-12-08 19:19:23,479 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-08 19:19:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25356 states. [2018-12-08 19:19:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25356 to 16160. [2018-12-08 19:19:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2018-12-08 19:19:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 51762 transitions. [2018-12-08 19:19:23,831 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 51762 transitions. Word has length 48 [2018-12-08 19:19:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:23,832 INFO L480 AbstractCegarLoop]: Abstraction has 16160 states and 51762 transitions. [2018-12-08 19:19:23,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:19:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 51762 transitions. [2018-12-08 19:19:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 19:19:23,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:23,834 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-08 19:19:23,834 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:23,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2018-12-08 19:19:23,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:23,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:23,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:23,867 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-08 19:19:23,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:23,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:19:23,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:23,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:19:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:19:23,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:19:23,868 INFO L87 Difference]: Start difference. First operand 16160 states and 51762 transitions. Second operand 3 states. [2018-12-08 19:19:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:23,981 INFO L93 Difference]: Finished difference Result 30242 states and 95729 transitions. [2018-12-08 19:19:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:19:23,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 19:19:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:24,017 INFO L225 Difference]: With dead ends: 30242 [2018-12-08 19:19:24,017 INFO L226 Difference]: Without dead ends: 30242 [2018-12-08 19:19:24,017 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-08 19:19:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30242 states. [2018-12-08 19:19:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30242 to 24713. [2018-12-08 19:19:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2018-12-08 19:19:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 78043 transitions. [2018-12-08 19:19:24,318 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 78043 transitions. Word has length 50 [2018-12-08 19:19:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 24713 states and 78043 transitions. [2018-12-08 19:19:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:19:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 78043 transitions. [2018-12-08 19:19:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 19:19:24,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:24,321 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-08 19:19:24,321 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:24,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:24,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2018-12-08 19:19:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:24,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:24,368 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-08 19:19:24,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:24,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:19:24,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:19:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:19:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:19:24,369 INFO L87 Difference]: Start difference. First operand 24713 states and 78043 transitions. Second operand 6 states. [2018-12-08 19:19:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:24,800 INFO L93 Difference]: Finished difference Result 35355 states and 111009 transitions. [2018-12-08 19:19:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:19:24,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 19:19:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:24,844 INFO L225 Difference]: With dead ends: 35355 [2018-12-08 19:19:24,844 INFO L226 Difference]: Without dead ends: 35283 [2018-12-08 19:19:24,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:19:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35283 states. [2018-12-08 19:19:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35283 to 24760. [2018-12-08 19:19:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2018-12-08 19:19:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 78149 transitions. [2018-12-08 19:19:25,167 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 78149 transitions. Word has length 54 [2018-12-08 19:19:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:25,167 INFO L480 AbstractCegarLoop]: Abstraction has 24760 states and 78149 transitions. [2018-12-08 19:19:25,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:19:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 78149 transitions. [2018-12-08 19:19:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 19:19:25,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:25,171 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-08 19:19:25,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:25,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:25,172 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2018-12-08 19:19:25,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:25,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:25,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:25,216 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-08 19:19:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:25,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:25,218 INFO L87 Difference]: Start difference. First operand 24760 states and 78149 transitions. Second operand 4 states. [2018-12-08 19:19:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:25,413 INFO L93 Difference]: Finished difference Result 28877 states and 90795 transitions. [2018-12-08 19:19:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:19:25,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-08 19:19:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:25,449 INFO L225 Difference]: With dead ends: 28877 [2018-12-08 19:19:25,449 INFO L226 Difference]: Without dead ends: 28877 [2018-12-08 19:19:25,449 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-08 19:19:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28877 states. [2018-12-08 19:19:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28877 to 28097. [2018-12-08 19:19:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28097 states. [2018-12-08 19:19:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28097 states to 28097 states and 88459 transitions. [2018-12-08 19:19:25,883 INFO L78 Accepts]: Start accepts. Automaton has 28097 states and 88459 transitions. Word has length 62 [2018-12-08 19:19:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:25,883 INFO L480 AbstractCegarLoop]: Abstraction has 28097 states and 88459 transitions. [2018-12-08 19:19:25,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28097 states and 88459 transitions. [2018-12-08 19:19:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 19:19:25,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:25,887 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-08 19:19:25,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:25,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2018-12-08 19:19:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:25,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:25,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:25,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:25,931 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-08 19:19:25,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:25,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:19:25,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:19:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:19:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:19:25,932 INFO L87 Difference]: Start difference. First operand 28097 states and 88459 transitions. Second operand 6 states. [2018-12-08 19:19:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:26,472 INFO L93 Difference]: Finished difference Result 58735 states and 182823 transitions. [2018-12-08 19:19:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:19:26,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-08 19:19:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:26,549 INFO L225 Difference]: With dead ends: 58735 [2018-12-08 19:19:26,550 INFO L226 Difference]: Without dead ends: 58664 [2018-12-08 19:19:26,550 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-08 19:19:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58664 states. [2018-12-08 19:19:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58664 to 36269. [2018-12-08 19:19:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36269 states. [2018-12-08 19:19:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36269 states to 36269 states and 111482 transitions. [2018-12-08 19:19:27,050 INFO L78 Accepts]: Start accepts. Automaton has 36269 states and 111482 transitions. Word has length 62 [2018-12-08 19:19:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:27,050 INFO L480 AbstractCegarLoop]: Abstraction has 36269 states and 111482 transitions. [2018-12-08 19:19:27,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:19:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36269 states and 111482 transitions. [2018-12-08 19:19:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 19:19:27,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:27,056 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-08 19:19:27,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:27,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:27,057 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2018-12-08 19:19:27,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:27,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:27,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:27,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:27,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:27,095 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-08 19:19:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:27,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:19:27,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:27,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:19:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:19:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:19:27,096 INFO L87 Difference]: Start difference. First operand 36269 states and 111482 transitions. Second operand 3 states. [2018-12-08 19:19:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:27,254 INFO L93 Difference]: Finished difference Result 44982 states and 136819 transitions. [2018-12-08 19:19:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:19:27,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-08 19:19:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:27,305 INFO L225 Difference]: With dead ends: 44982 [2018-12-08 19:19:27,306 INFO L226 Difference]: Without dead ends: 44982 [2018-12-08 19:19:27,306 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-08 19:19:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44982 states. [2018-12-08 19:19:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44982 to 36865. [2018-12-08 19:19:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36865 states. [2018-12-08 19:19:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36865 states to 36865 states and 111150 transitions. [2018-12-08 19:19:27,720 INFO L78 Accepts]: Start accepts. Automaton has 36865 states and 111150 transitions. Word has length 68 [2018-12-08 19:19:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:27,721 INFO L480 AbstractCegarLoop]: Abstraction has 36865 states and 111150 transitions. [2018-12-08 19:19:27,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:19:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 36865 states and 111150 transitions. [2018-12-08 19:19:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 19:19:27,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:27,730 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-08 19:19:27,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:27,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2018-12-08 19:19:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:27,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:27,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:19:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:19:27,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:27,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:19:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:19:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:19:27,799 INFO L87 Difference]: Start difference. First operand 36865 states and 111150 transitions. Second operand 5 states. [2018-12-08 19:19:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:28,137 INFO L93 Difference]: Finished difference Result 41458 states and 124779 transitions. [2018-12-08 19:19:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:19:28,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-08 19:19:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:28,187 INFO L225 Difference]: With dead ends: 41458 [2018-12-08 19:19:28,188 INFO L226 Difference]: Without dead ends: 41458 [2018-12-08 19:19:28,188 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-08 19:19:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41458 states. [2018-12-08 19:19:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41458 to 37226. [2018-12-08 19:19:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37226 states. [2018-12-08 19:19:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37226 states to 37226 states and 112139 transitions. [2018-12-08 19:19:28,627 INFO L78 Accepts]: Start accepts. Automaton has 37226 states and 112139 transitions. Word has length 74 [2018-12-08 19:19:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:28,628 INFO L480 AbstractCegarLoop]: Abstraction has 37226 states and 112139 transitions. [2018-12-08 19:19:28,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:19:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37226 states and 112139 transitions. [2018-12-08 19:19:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 19:19:28,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:28,637 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-08 19:19:28,637 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2018-12-08 19:19:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:28,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:28,701 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-08 19:19:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:28,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:28,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:28,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:28,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:28,702 INFO L87 Difference]: Start difference. First operand 37226 states and 112139 transitions. Second operand 7 states. [2018-12-08 19:19:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:29,321 INFO L93 Difference]: Finished difference Result 44484 states and 134041 transitions. [2018-12-08 19:19:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 19:19:29,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-08 19:19:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:29,370 INFO L225 Difference]: With dead ends: 44484 [2018-12-08 19:19:29,371 INFO L226 Difference]: Without dead ends: 44397 [2018-12-08 19:19:29,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-08 19:19:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44397 states. [2018-12-08 19:19:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44397 to 33386. [2018-12-08 19:19:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33386 states. [2018-12-08 19:19:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33386 states to 33386 states and 101987 transitions. [2018-12-08 19:19:29,772 INFO L78 Accepts]: Start accepts. Automaton has 33386 states and 101987 transitions. Word has length 74 [2018-12-08 19:19:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:29,772 INFO L480 AbstractCegarLoop]: Abstraction has 33386 states and 101987 transitions. [2018-12-08 19:19:29,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 33386 states and 101987 transitions. [2018-12-08 19:19:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 19:19:29,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:29,782 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-08 19:19:29,782 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:29,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2018-12-08 19:19:29,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:29,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:29,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:29,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:29,809 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-08 19:19:29,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:29,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:29,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:29,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:29,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:29,810 INFO L87 Difference]: Start difference. First operand 33386 states and 101987 transitions. Second operand 4 states. [2018-12-08 19:19:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:30,261 INFO L93 Difference]: Finished difference Result 46919 states and 139168 transitions. [2018-12-08 19:19:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:19:30,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-08 19:19:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:30,312 INFO L225 Difference]: With dead ends: 46919 [2018-12-08 19:19:30,312 INFO L226 Difference]: Without dead ends: 46919 [2018-12-08 19:19:30,312 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-08 19:19:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46919 states. [2018-12-08 19:19:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46919 to 41583. [2018-12-08 19:19:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41583 states. [2018-12-08 19:19:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41583 states to 41583 states and 124562 transitions. [2018-12-08 19:19:30,772 INFO L78 Accepts]: Start accepts. Automaton has 41583 states and 124562 transitions. Word has length 76 [2018-12-08 19:19:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:30,773 INFO L480 AbstractCegarLoop]: Abstraction has 41583 states and 124562 transitions. [2018-12-08 19:19:30,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 41583 states and 124562 transitions. [2018-12-08 19:19:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 19:19:30,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:30,786 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2018-12-08 19:19:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:30,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:30,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:30,846 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-08 19:19:30,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:30,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:30,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:30,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:30,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:30,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:30,847 INFO L87 Difference]: Start difference. First operand 41583 states and 124562 transitions. Second operand 7 states. [2018-12-08 19:19:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:31,700 INFO L93 Difference]: Finished difference Result 97674 states and 289296 transitions. [2018-12-08 19:19:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 19:19:31,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-08 19:19:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:31,817 INFO L225 Difference]: With dead ends: 97674 [2018-12-08 19:19:31,817 INFO L226 Difference]: Without dead ends: 97610 [2018-12-08 19:19:31,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-08 19:19:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97610 states. [2018-12-08 19:19:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97610 to 56647. [2018-12-08 19:19:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56647 states. [2018-12-08 19:19:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56647 states to 56647 states and 166937 transitions. [2018-12-08 19:19:32,686 INFO L78 Accepts]: Start accepts. Automaton has 56647 states and 166937 transitions. Word has length 76 [2018-12-08 19:19:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 56647 states and 166937 transitions. [2018-12-08 19:19:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 56647 states and 166937 transitions. [2018-12-08 19:19:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:19:32,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:32,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:32,709 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:32,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash 153257945, now seen corresponding path program 1 times [2018-12-08 19:19:32,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:32,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:32,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:32,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:32,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:32,746 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-08 19:19:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:32,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:32,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:32,747 INFO L87 Difference]: Start difference. First operand 56647 states and 166937 transitions. Second operand 4 states. [2018-12-08 19:19:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:33,035 INFO L93 Difference]: Finished difference Result 62874 states and 184413 transitions. [2018-12-08 19:19:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:19:33,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-08 19:19:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:33,104 INFO L225 Difference]: With dead ends: 62874 [2018-12-08 19:19:33,104 INFO L226 Difference]: Without dead ends: 62874 [2018-12-08 19:19:33,104 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-08 19:19:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62874 states. [2018-12-08 19:19:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62874 to 61596. [2018-12-08 19:19:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61596 states. [2018-12-08 19:19:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61596 states to 61596 states and 180682 transitions. [2018-12-08 19:19:33,757 INFO L78 Accepts]: Start accepts. Automaton has 61596 states and 180682 transitions. Word has length 82 [2018-12-08 19:19:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:33,758 INFO L480 AbstractCegarLoop]: Abstraction has 61596 states and 180682 transitions. [2018-12-08 19:19:33,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 61596 states and 180682 transitions. [2018-12-08 19:19:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 19:19:33,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:33,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:33,783 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:33,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1923951398, now seen corresponding path program 1 times [2018-12-08 19:19:33,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:33,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:33,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:33,813 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-08 19:19:33,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:33,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:19:33,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:19:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:19:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:19:33,814 INFO L87 Difference]: Start difference. First operand 61596 states and 180682 transitions. Second operand 3 states. [2018-12-08 19:19:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:34,101 INFO L93 Difference]: Finished difference Result 73882 states and 212774 transitions. [2018-12-08 19:19:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:19:34,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-08 19:19:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:34,186 INFO L225 Difference]: With dead ends: 73882 [2018-12-08 19:19:34,186 INFO L226 Difference]: Without dead ends: 73882 [2018-12-08 19:19:34,186 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-08 19:19:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73882 states. [2018-12-08 19:19:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73882 to 69194. [2018-12-08 19:19:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69194 states. [2018-12-08 19:19:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69194 states to 69194 states and 200395 transitions. [2018-12-08 19:19:34,999 INFO L78 Accepts]: Start accepts. Automaton has 69194 states and 200395 transitions. Word has length 82 [2018-12-08 19:19:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:35,000 INFO L480 AbstractCegarLoop]: Abstraction has 69194 states and 200395 transitions. [2018-12-08 19:19:35,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:19:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 69194 states and 200395 transitions. [2018-12-08 19:19:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:19:35,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:35,036 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-08 19:19:35,036 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:35,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1319576706, now seen corresponding path program 1 times [2018-12-08 19:19:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:35,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:35,078 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-08 19:19:35,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:35,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:35,079 INFO L87 Difference]: Start difference. First operand 69194 states and 200395 transitions. Second operand 4 states. [2018-12-08 19:19:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:35,338 INFO L93 Difference]: Finished difference Result 75677 states and 216537 transitions. [2018-12-08 19:19:35,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:19:35,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 19:19:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:35,424 INFO L225 Difference]: With dead ends: 75677 [2018-12-08 19:19:35,424 INFO L226 Difference]: Without dead ends: 75677 [2018-12-08 19:19:35,424 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-08 19:19:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75677 states. [2018-12-08 19:19:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75677 to 70724. [2018-12-08 19:19:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70724 states. [2018-12-08 19:19:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70724 states to 70724 states and 202400 transitions. [2018-12-08 19:19:36,268 INFO L78 Accepts]: Start accepts. Automaton has 70724 states and 202400 transitions. Word has length 83 [2018-12-08 19:19:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 70724 states and 202400 transitions. [2018-12-08 19:19:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 70724 states and 202400 transitions. [2018-12-08 19:19:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:19:36,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:36,293 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-08 19:19:36,293 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:36,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:36,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1201211927, now seen corresponding path program 1 times [2018-12-08 19:19:36,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:36,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:36,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:36,339 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-08 19:19:36,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:36,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:19:36,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:36,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:19:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:19:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:19:36,340 INFO L87 Difference]: Start difference. First operand 70724 states and 202400 transitions. Second operand 4 states. [2018-12-08 19:19:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:36,555 INFO L93 Difference]: Finished difference Result 76557 states and 218374 transitions. [2018-12-08 19:19:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:19:36,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 19:19:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:36,645 INFO L225 Difference]: With dead ends: 76557 [2018-12-08 19:19:36,645 INFO L226 Difference]: Without dead ends: 76557 [2018-12-08 19:19:36,645 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-08 19:19:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76557 states. [2018-12-08 19:19:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76557 to 71702. [2018-12-08 19:19:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-08 19:19:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-08 19:19:37,429 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-08 19:19:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:37,430 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-08 19:19:37,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:19:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-08 19:19:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:19:37,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:37,454 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-08 19:19:37,454 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2103727433, now seen corresponding path program 1 times [2018-12-08 19:19:37,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:37,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:37,521 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-08 19:19:37,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:37,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:19:37,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:37,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:19:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:19:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:19:37,522 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-08 19:19:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:39,184 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-08 19:19:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 19:19:39,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-08 19:19:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:39,402 INFO L225 Difference]: With dead ends: 164487 [2018-12-08 19:19:39,402 INFO L226 Difference]: Without dead ends: 164487 [2018-12-08 19:19:39,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-08 19:19:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-08 19:19:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-08 19:19:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-08 19:19:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-08 19:19:41,050 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-08 19:19:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:41,051 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-08 19:19:41,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:19:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-08 19:19:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:19:41,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:41,087 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-08 19:19:41,087 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:41,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1216223752, now seen corresponding path program 1 times [2018-12-08 19:19:41,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:41,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:41,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:41,143 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-08 19:19:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:19:41,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:41,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:19:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:19:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:19:41,144 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2018-12-08 19:19:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:41,230 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2018-12-08 19:19:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:19:41,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-08 19:19:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:41,255 INFO L225 Difference]: With dead ends: 35805 [2018-12-08 19:19:41,255 INFO L226 Difference]: Without dead ends: 31165 [2018-12-08 19:19:41,256 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-08 19:19:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2018-12-08 19:19:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2018-12-08 19:19:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2018-12-08 19:19:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2018-12-08 19:19:41,518 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2018-12-08 19:19:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:41,518 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2018-12-08 19:19:41,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:19:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2018-12-08 19:19:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:19:41,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:41,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:41,538 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:41,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash -215687725, now seen corresponding path program 1 times [2018-12-08 19:19:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:41,589 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-08 19:19:41,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:41,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:19:41,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:41,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:19:41,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:19:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:19:41,590 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2018-12-08 19:19:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:41,697 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2018-12-08 19:19:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:19:41,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-08 19:19:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:41,720 INFO L225 Difference]: With dead ends: 30725 [2018-12-08 19:19:41,720 INFO L226 Difference]: Without dead ends: 30725 [2018-12-08 19:19:41,721 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-08 19:19:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2018-12-08 19:19:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2018-12-08 19:19:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2018-12-08 19:19:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2018-12-08 19:19:41,941 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2018-12-08 19:19:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:41,942 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2018-12-08 19:19:41,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:19:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2018-12-08 19:19:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:19:41,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:41,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:41,959 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:41,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash 222321778, now seen corresponding path program 1 times [2018-12-08 19:19:41,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:41,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:42,060 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-08 19:19:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:42,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:19:42,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:42,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:19:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:19:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:19:42,062 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 8 states. [2018-12-08 19:19:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:42,616 INFO L93 Difference]: Finished difference Result 36935 states and 85768 transitions. [2018-12-08 19:19:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 19:19:42,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-08 19:19:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:42,643 INFO L225 Difference]: With dead ends: 36935 [2018-12-08 19:19:42,643 INFO L226 Difference]: Without dead ends: 36697 [2018-12-08 19:19:42,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:19:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36697 states. [2018-12-08 19:19:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36697 to 29289. [2018-12-08 19:19:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29289 states. [2018-12-08 19:19:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29289 states to 29289 states and 68874 transitions. [2018-12-08 19:19:42,931 INFO L78 Accepts]: Start accepts. Automaton has 29289 states and 68874 transitions. Word has length 111 [2018-12-08 19:19:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:42,931 INFO L480 AbstractCegarLoop]: Abstraction has 29289 states and 68874 transitions. [2018-12-08 19:19:42,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:19:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29289 states and 68874 transitions. [2018-12-08 19:19:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:19:42,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:42,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:42,954 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:42,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2042518608, now seen corresponding path program 1 times [2018-12-08 19:19:42,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:42,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:43,031 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-08 19:19:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:43,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:43,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:43,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:43,032 INFO L87 Difference]: Start difference. First operand 29289 states and 68874 transitions. Second operand 7 states. [2018-12-08 19:19:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:43,588 INFO L93 Difference]: Finished difference Result 37107 states and 86468 transitions. [2018-12-08 19:19:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:19:43,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-08 19:19:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:43,630 INFO L225 Difference]: With dead ends: 37107 [2018-12-08 19:19:43,631 INFO L226 Difference]: Without dead ends: 37107 [2018-12-08 19:19:43,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-08 19:19:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37107 states. [2018-12-08 19:19:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37107 to 30673. [2018-12-08 19:19:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30673 states. [2018-12-08 19:19:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30673 states to 30673 states and 71460 transitions. [2018-12-08 19:19:43,926 INFO L78 Accepts]: Start accepts. Automaton has 30673 states and 71460 transitions. Word has length 111 [2018-12-08 19:19:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:43,927 INFO L480 AbstractCegarLoop]: Abstraction has 30673 states and 71460 transitions. [2018-12-08 19:19:43,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30673 states and 71460 transitions. [2018-12-08 19:19:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:19:43,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:43,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:19:43,949 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:43,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash 190679158, now seen corresponding path program 2 times [2018-12-08 19:19:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:43,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:43,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:43,990 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-08 19:19:43,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:43,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:19:43,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:43,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:19:43,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:19:43,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:19:43,991 INFO L87 Difference]: Start difference. First operand 30673 states and 71460 transitions. Second operand 5 states. [2018-12-08 19:19:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:44,214 INFO L93 Difference]: Finished difference Result 31480 states and 73245 transitions. [2018-12-08 19:19:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:19:44,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-08 19:19:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:44,237 INFO L225 Difference]: With dead ends: 31480 [2018-12-08 19:19:44,237 INFO L226 Difference]: Without dead ends: 31480 [2018-12-08 19:19:44,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31480 states. [2018-12-08 19:19:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31480 to 31107. [2018-12-08 19:19:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31107 states. [2018-12-08 19:19:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31107 states to 31107 states and 72433 transitions. [2018-12-08 19:19:44,502 INFO L78 Accepts]: Start accepts. Automaton has 31107 states and 72433 transitions. Word has length 111 [2018-12-08 19:19:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:44,502 INFO L480 AbstractCegarLoop]: Abstraction has 31107 states and 72433 transitions. [2018-12-08 19:19:44,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:19:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31107 states and 72433 transitions. [2018-12-08 19:19:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:19:44,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:19:44,530 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:44,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash -817303495, now seen corresponding path program 1 times [2018-12-08 19:19:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:44,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:19:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:44,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:19:44,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:44,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:44,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:44,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:44,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:44,641 INFO L87 Difference]: Start difference. First operand 31107 states and 72433 transitions. Second operand 7 states. [2018-12-08 19:19:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:44,907 INFO L93 Difference]: Finished difference Result 38217 states and 88199 transitions. [2018-12-08 19:19:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:19:44,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 19:19:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:44,939 INFO L225 Difference]: With dead ends: 38217 [2018-12-08 19:19:44,939 INFO L226 Difference]: Without dead ends: 38217 [2018-12-08 19:19:44,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:19:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38217 states. [2018-12-08 19:19:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38217 to 32959. [2018-12-08 19:19:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32959 states. [2018-12-08 19:19:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32959 states to 32959 states and 76574 transitions. [2018-12-08 19:19:45,356 INFO L78 Accepts]: Start accepts. Automaton has 32959 states and 76574 transitions. Word has length 113 [2018-12-08 19:19:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:45,356 INFO L480 AbstractCegarLoop]: Abstraction has 32959 states and 76574 transitions. [2018-12-08 19:19:45,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32959 states and 76574 transitions. [2018-12-08 19:19:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:19:45,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:45,378 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-08 19:19:45,378 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:45,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2018-12-08 19:19:45,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:45,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:45,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:45,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:45,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:45,468 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-08 19:19:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:45,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:45,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:45,469 INFO L87 Difference]: Start difference. First operand 32959 states and 76574 transitions. Second operand 7 states. [2018-12-08 19:19:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:45,626 INFO L93 Difference]: Finished difference Result 37253 states and 86054 transitions. [2018-12-08 19:19:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:19:45,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 19:19:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:45,655 INFO L225 Difference]: With dead ends: 37253 [2018-12-08 19:19:45,655 INFO L226 Difference]: Without dead ends: 37253 [2018-12-08 19:19:45,655 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-08 19:19:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37253 states. [2018-12-08 19:19:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37253 to 30244. [2018-12-08 19:19:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30244 states. [2018-12-08 19:19:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30244 states to 30244 states and 70067 transitions. [2018-12-08 19:19:45,944 INFO L78 Accepts]: Start accepts. Automaton has 30244 states and 70067 transitions. Word has length 113 [2018-12-08 19:19:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:45,944 INFO L480 AbstractCegarLoop]: Abstraction has 30244 states and 70067 transitions. [2018-12-08 19:19:45,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30244 states and 70067 transitions. [2018-12-08 19:19:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:19:45,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:45,968 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-08 19:19:45,968 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:45,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1486128550, now seen corresponding path program 1 times [2018-12-08 19:19:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:45,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:46,034 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-08 19:19:46,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:46,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:19:46,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:46,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:19:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:19:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:19:46,035 INFO L87 Difference]: Start difference. First operand 30244 states and 70067 transitions. Second operand 6 states. [2018-12-08 19:19:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:46,169 INFO L93 Difference]: Finished difference Result 30100 states and 69483 transitions. [2018-12-08 19:19:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:19:46,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-08 19:19:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:46,191 INFO L225 Difference]: With dead ends: 30100 [2018-12-08 19:19:46,191 INFO L226 Difference]: Without dead ends: 30100 [2018-12-08 19:19:46,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:19:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30100 states. [2018-12-08 19:19:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30100 to 26611. [2018-12-08 19:19:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26611 states. [2018-12-08 19:19:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26611 states to 26611 states and 61632 transitions. [2018-12-08 19:19:46,433 INFO L78 Accepts]: Start accepts. Automaton has 26611 states and 61632 transitions. Word has length 113 [2018-12-08 19:19:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:46,433 INFO L480 AbstractCegarLoop]: Abstraction has 26611 states and 61632 transitions. [2018-12-08 19:19:46,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:19:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26611 states and 61632 transitions. [2018-12-08 19:19:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:19:46,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:46,453 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-08 19:19:46,453 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:46,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -865004383, now seen corresponding path program 1 times [2018-12-08 19:19:46,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:46,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:46,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:46,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:46,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:46,493 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-08 19:19:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:46,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:19:46,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:19:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:19:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:19:46,494 INFO L87 Difference]: Start difference. First operand 26611 states and 61632 transitions. Second operand 6 states. [2018-12-08 19:19:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:46,776 INFO L93 Difference]: Finished difference Result 30586 states and 70246 transitions. [2018-12-08 19:19:46,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:19:46,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-08 19:19:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:46,798 INFO L225 Difference]: With dead ends: 30586 [2018-12-08 19:19:46,798 INFO L226 Difference]: Without dead ends: 30586 [2018-12-08 19:19:46,798 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-08 19:19:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30586 states. [2018-12-08 19:19:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30586 to 26698. [2018-12-08 19:19:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26698 states. [2018-12-08 19:19:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26698 states to 26698 states and 61795 transitions. [2018-12-08 19:19:47,035 INFO L78 Accepts]: Start accepts. Automaton has 26698 states and 61795 transitions. Word has length 113 [2018-12-08 19:19:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:47,036 INFO L480 AbstractCegarLoop]: Abstraction has 26698 states and 61795 transitions. [2018-12-08 19:19:47,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:19:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 26698 states and 61795 transitions. [2018-12-08 19:19:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:47,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:47,055 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-08 19:19:47,055 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:47,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash 314506688, now seen corresponding path program 1 times [2018-12-08 19:19:47,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:47,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:47,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:47,126 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-08 19:19:47,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:47,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:47,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:47,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:47,126 INFO L87 Difference]: Start difference. First operand 26698 states and 61795 transitions. Second operand 7 states. [2018-12-08 19:19:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:47,424 INFO L93 Difference]: Finished difference Result 35402 states and 80951 transitions. [2018-12-08 19:19:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:19:47,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-08 19:19:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:47,450 INFO L225 Difference]: With dead ends: 35402 [2018-12-08 19:19:47,450 INFO L226 Difference]: Without dead ends: 35359 [2018-12-08 19:19:47,450 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-08 19:19:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35359 states. [2018-12-08 19:19:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35359 to 26901. [2018-12-08 19:19:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26901 states. [2018-12-08 19:19:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26901 states to 26901 states and 62034 transitions. [2018-12-08 19:19:47,723 INFO L78 Accepts]: Start accepts. Automaton has 26901 states and 62034 transitions. Word has length 115 [2018-12-08 19:19:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 26901 states and 62034 transitions. [2018-12-08 19:19:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26901 states and 62034 transitions. [2018-12-08 19:19:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:47,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:47,746 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-08 19:19:47,746 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:47,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:47,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1762702655, now seen corresponding path program 1 times [2018-12-08 19:19:47,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:47,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:47,824 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-08 19:19:47,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:47,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:47,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:47,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:47,825 INFO L87 Difference]: Start difference. First operand 26901 states and 62034 transitions. Second operand 7 states. [2018-12-08 19:19:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:48,143 INFO L93 Difference]: Finished difference Result 34449 states and 77966 transitions. [2018-12-08 19:19:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:19:48,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-08 19:19:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:48,168 INFO L225 Difference]: With dead ends: 34449 [2018-12-08 19:19:48,168 INFO L226 Difference]: Without dead ends: 34427 [2018-12-08 19:19:48,168 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-08 19:19:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34427 states. [2018-12-08 19:19:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34427 to 29879. [2018-12-08 19:19:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29879 states. [2018-12-08 19:19:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29879 states to 29879 states and 68155 transitions. [2018-12-08 19:19:48,448 INFO L78 Accepts]: Start accepts. Automaton has 29879 states and 68155 transitions. Word has length 115 [2018-12-08 19:19:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:48,448 INFO L480 AbstractCegarLoop]: Abstraction has 29879 states and 68155 transitions. [2018-12-08 19:19:48,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29879 states and 68155 transitions. [2018-12-08 19:19:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:48,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:48,470 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-08 19:19:48,470 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:48,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1551351742, now seen corresponding path program 1 times [2018-12-08 19:19:48,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:48,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:48,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:48,559 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-08 19:19:48,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:48,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:19:48,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:48,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:19:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:19:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:19:48,560 INFO L87 Difference]: Start difference. First operand 29879 states and 68155 transitions. Second operand 7 states. [2018-12-08 19:19:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:48,756 INFO L93 Difference]: Finished difference Result 30955 states and 70470 transitions. [2018-12-08 19:19:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:19:48,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-08 19:19:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:48,777 INFO L225 Difference]: With dead ends: 30955 [2018-12-08 19:19:48,777 INFO L226 Difference]: Without dead ends: 30955 [2018-12-08 19:19:48,777 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-08 19:19:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2018-12-08 19:19:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30324. [2018-12-08 19:19:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30324 states. [2018-12-08 19:19:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30324 states to 30324 states and 69187 transitions. [2018-12-08 19:19:49,034 INFO L78 Accepts]: Start accepts. Automaton has 30324 states and 69187 transitions. Word has length 115 [2018-12-08 19:19:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:49,035 INFO L480 AbstractCegarLoop]: Abstraction has 30324 states and 69187 transitions. [2018-12-08 19:19:49,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:19:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30324 states and 69187 transitions. [2018-12-08 19:19:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:49,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:49,057 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-08 19:19:49,057 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:49,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash -663848061, now seen corresponding path program 1 times [2018-12-08 19:19:49,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:49,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:49,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:49,078 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-08 19:19:49,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:49,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:19:49,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:49,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:19:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:19:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:19:49,079 INFO L87 Difference]: Start difference. First operand 30324 states and 69187 transitions. Second operand 3 states. [2018-12-08 19:19:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:49,143 INFO L93 Difference]: Finished difference Result 37846 states and 85737 transitions. [2018-12-08 19:19:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:19:49,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-08 19:19:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:49,172 INFO L225 Difference]: With dead ends: 37846 [2018-12-08 19:19:49,172 INFO L226 Difference]: Without dead ends: 37846 [2018-12-08 19:19:49,172 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-08 19:19:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37846 states. [2018-12-08 19:19:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37846 to 37530. [2018-12-08 19:19:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37530 states. [2018-12-08 19:19:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37530 states to 37530 states and 85048 transitions. [2018-12-08 19:19:49,483 INFO L78 Accepts]: Start accepts. Automaton has 37530 states and 85048 transitions. Word has length 115 [2018-12-08 19:19:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:49,483 INFO L480 AbstractCegarLoop]: Abstraction has 37530 states and 85048 transitions. [2018-12-08 19:19:49,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:19:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 37530 states and 85048 transitions. [2018-12-08 19:19:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:49,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:49,509 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-08 19:19:49,509 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:49,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1061632836, now seen corresponding path program 1 times [2018-12-08 19:19:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:49,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:49,611 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-08 19:19:49,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:49,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 19:19:49,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:49,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 19:19:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 19:19:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:19:49,611 INFO L87 Difference]: Start difference. First operand 37530 states and 85048 transitions. Second operand 13 states. [2018-12-08 19:19:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:50,058 INFO L93 Difference]: Finished difference Result 61873 states and 140203 transitions. [2018-12-08 19:19:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 19:19:50,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-08 19:19:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:50,099 INFO L225 Difference]: With dead ends: 61873 [2018-12-08 19:19:50,099 INFO L226 Difference]: Without dead ends: 52358 [2018-12-08 19:19:50,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-12-08 19:19:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52358 states. [2018-12-08 19:19:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52358 to 42961. [2018-12-08 19:19:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42961 states. [2018-12-08 19:19:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42961 states to 42961 states and 96837 transitions. [2018-12-08 19:19:50,510 INFO L78 Accepts]: Start accepts. Automaton has 42961 states and 96837 transitions. Word has length 115 [2018-12-08 19:19:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:50,510 INFO L480 AbstractCegarLoop]: Abstraction has 42961 states and 96837 transitions. [2018-12-08 19:19:50,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 19:19:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42961 states and 96837 transitions. [2018-12-08 19:19:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:50,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:50,539 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-08 19:19:50,539 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:50,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2085529924, now seen corresponding path program 2 times [2018-12-08 19:19:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:50,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:50,670 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-08 19:19:50,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 19:19:50,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:50,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 19:19:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 19:19:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:19:50,670 INFO L87 Difference]: Start difference. First operand 42961 states and 96837 transitions. Second operand 15 states. [2018-12-08 19:19:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:51,839 INFO L93 Difference]: Finished difference Result 106445 states and 241389 transitions. [2018-12-08 19:19:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 19:19:51,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-12-08 19:19:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:51,907 INFO L225 Difference]: With dead ends: 106445 [2018-12-08 19:19:51,907 INFO L226 Difference]: Without dead ends: 81288 [2018-12-08 19:19:51,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 19:19:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81288 states. [2018-12-08 19:19:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81288 to 51122. [2018-12-08 19:19:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51122 states. [2018-12-08 19:19:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51122 states to 51122 states and 114199 transitions. [2018-12-08 19:19:52,538 INFO L78 Accepts]: Start accepts. Automaton has 51122 states and 114199 transitions. Word has length 115 [2018-12-08 19:19:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:52,538 INFO L480 AbstractCegarLoop]: Abstraction has 51122 states and 114199 transitions. [2018-12-08 19:19:52,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 19:19:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 51122 states and 114199 transitions. [2018-12-08 19:19:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:52,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:52,580 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-08 19:19:52,580 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:52,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1226976344, now seen corresponding path program 3 times [2018-12-08 19:19:52,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:52,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:52,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:19:52,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:52,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:52,675 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-08 19:19:52,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:52,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 19:19:52,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:52,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 19:19:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 19:19:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:19:52,676 INFO L87 Difference]: Start difference. First operand 51122 states and 114199 transitions. Second operand 13 states. [2018-12-08 19:19:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:53,260 INFO L93 Difference]: Finished difference Result 70615 states and 158454 transitions. [2018-12-08 19:19:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 19:19:53,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-08 19:19:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:53,308 INFO L225 Difference]: With dead ends: 70615 [2018-12-08 19:19:53,308 INFO L226 Difference]: Without dead ends: 62043 [2018-12-08 19:19:53,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 19:19:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62043 states. [2018-12-08 19:19:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62043 to 52181. [2018-12-08 19:19:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52181 states. [2018-12-08 19:19:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52181 states to 52181 states and 116595 transitions. [2018-12-08 19:19:53,841 INFO L78 Accepts]: Start accepts. Automaton has 52181 states and 116595 transitions. Word has length 115 [2018-12-08 19:19:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:53,841 INFO L480 AbstractCegarLoop]: Abstraction has 52181 states and 116595 transitions. [2018-12-08 19:19:53,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 19:19:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 52181 states and 116595 transitions. [2018-12-08 19:19:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:53,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:53,882 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-08 19:19:53,883 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:53,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 861923247, now seen corresponding path program 1 times [2018-12-08 19:19:53,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:53,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:53,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:19:53,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:53,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:54,068 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-08 19:19:54,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:54,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-08 19:19:54,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:54,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 19:19:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 19:19:54,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-12-08 19:19:54,069 INFO L87 Difference]: Start difference. First operand 52181 states and 116595 transitions. Second operand 18 states. [2018-12-08 19:19:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:55,461 INFO L93 Difference]: Finished difference Result 71298 states and 160199 transitions. [2018-12-08 19:19:55,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-08 19:19:55,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-12-08 19:19:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:55,512 INFO L225 Difference]: With dead ends: 71298 [2018-12-08 19:19:55,512 INFO L226 Difference]: Without dead ends: 62360 [2018-12-08 19:19:55,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=1886, Unknown=0, NotChecked=0, Total=2162 [2018-12-08 19:19:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62360 states. [2018-12-08 19:19:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62360 to 51523. [2018-12-08 19:19:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51523 states. [2018-12-08 19:19:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51523 states to 51523 states and 115255 transitions. [2018-12-08 19:19:56,041 INFO L78 Accepts]: Start accepts. Automaton has 51523 states and 115255 transitions. Word has length 115 [2018-12-08 19:19:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:56,041 INFO L480 AbstractCegarLoop]: Abstraction has 51523 states and 115255 transitions. [2018-12-08 19:19:56,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 19:19:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 51523 states and 115255 transitions. [2018-12-08 19:19:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:56,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:56,082 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-08 19:19:56,082 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:56,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash -141669914, now seen corresponding path program 4 times [2018-12-08 19:19:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:56,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:19:56,170 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-08 19:19:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:19:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:19:56,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:19:56,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:19:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:19:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:19:56,170 INFO L87 Difference]: Start difference. First operand 51523 states and 115255 transitions. Second operand 10 states. [2018-12-08 19:19:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:19:56,567 INFO L93 Difference]: Finished difference Result 59181 states and 132315 transitions. [2018-12-08 19:19:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:19:56,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-12-08 19:19:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:19:56,571 INFO L225 Difference]: With dead ends: 59181 [2018-12-08 19:19:56,571 INFO L226 Difference]: Without dead ends: 5896 [2018-12-08 19:19:56,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:19:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2018-12-08 19:19:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5896. [2018-12-08 19:19:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5896 states. [2018-12-08 19:19:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 13726 transitions. [2018-12-08 19:19:56,608 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 13726 transitions. Word has length 115 [2018-12-08 19:19:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:19:56,608 INFO L480 AbstractCegarLoop]: Abstraction has 5896 states and 13726 transitions. [2018-12-08 19:19:56,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:19:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 13726 transitions. [2018-12-08 19:19:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:19:56,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:19:56,612 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-08 19:19:56,612 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:19:56,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:19:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1293718377, now seen corresponding path program 2 times [2018-12-08 19:19:56,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:19:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:19:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:19:56,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:19:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:19:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:19:56,689 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:19:56,767 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 19:19:56,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:19:56 BasicIcfg [2018-12-08 19:19:56,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:19:56,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:19:56,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:19:56,768 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:19:56,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:19:10" (3/4) ... [2018-12-08 19:19:56,770 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:19:56,849 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cf5e3859-d97b-41ee-ba41-8e62f034e33d/bin-2019/utaipan/witness.graphml [2018-12-08 19:19:56,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:19:56,850 INFO L168 Benchmark]: Toolchain (without parser) took 47504.78 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 952.4 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 780.8 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: Boogie Preprocessor took 20.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: RCFGBuilder took 413.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,851 INFO L168 Benchmark]: TraceAbstraction took 46568.55 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 667.9 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,852 INFO L168 Benchmark]: Witness Printer took 80.91 ms. Allocated memory is still 4.6 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-12-08 19:19:56,853 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 413.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46568.55 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 667.9 MB. Max. memory is 11.5 GB. * Witness Printer took 80.91 ms. Allocated memory is still 4.6 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [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] [L686] -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, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 pthread_t t12; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK -1 pthread_create(&t12, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 pthread_t t13; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK -1 pthread_create(&t13, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y 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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = 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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : 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, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 46.4s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16620 SDtfs, 20824 SDslu, 60040 SDs, 0 SdLazy, 14334 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 98 SyntacticMatches, 30 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104360occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 17.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 376396 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3268 NumberOfCodeBlocks, 3268 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3118 ConstructedInterpolants, 0 QuantifiedInterpolants, 855200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...