./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/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 c5f469fc5b86d177d3900ee1412b013cd6baa5f9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:35:13,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:35:13,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:35:13,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:35:13,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:35:13,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:35:13,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:35:13,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:35:13,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:35:13,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:35:13,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:35:13,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:35:13,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:35:13,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:35:13,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:35:13,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:35:13,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:35:13,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:35:13,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:35:13,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:35:13,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:35:13,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:35:13,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:35:13,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:35:13,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:35:13,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:35:13,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:35:13,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:35:13,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:35:13,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:35:13,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:35:13,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:35:13,439 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:35:13,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:35:13,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:35:13,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:35:13,440 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 16:35:13,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:35:13,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:35:13,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:35:13,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:35:13,448 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:35:13,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 16:35:13,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 16:35:13,449 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:35:13,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:35:13,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 16:35:13,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:35:13,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:35:13,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:35:13,451 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 16:35:13,451 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_6dd87417-40e8-4733-9803-a2f59b66bc4a/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 -> c5f469fc5b86d177d3900ee1412b013cd6baa5f9 [2018-12-08 16:35:13,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:35:13,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:35:13,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:35:13,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:35:13,482 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:35:13,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt_false-unreach-call.i [2018-12-08 16:35:13,521 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/data/e62be64ba/be0ae8839e504494b3249468a5d172d5/FLAGcfba5bd92 [2018-12-08 16:35:13,938 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:35:13,939 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/sv-benchmarks/c/pthread-wmm/rfi004_pso.opt_false-unreach-call.i [2018-12-08 16:35:13,945 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/data/e62be64ba/be0ae8839e504494b3249468a5d172d5/FLAGcfba5bd92 [2018-12-08 16:35:13,953 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/data/e62be64ba/be0ae8839e504494b3249468a5d172d5 [2018-12-08 16:35:13,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:35:13,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:35:13,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:35:13,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:35:13,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:35:13,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:35:13" (1/1) ... [2018-12-08 16:35:13,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11953753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:13, skipping insertion in model container [2018-12-08 16:35:13,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:35:13" (1/1) ... [2018-12-08 16:35:13,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:35:13,993 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:35:14,179 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:35:14,187 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:35:14,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:35:14,300 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:35:14,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14 WrapperNode [2018-12-08 16:35:14,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:35:14,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:35:14,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:35:14,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:35:14,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:35:14,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:35:14,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:35:14,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:35:14,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... [2018-12-08 16:35:14,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:35:14,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:35:14,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:35:14,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:35:14,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/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 16:35:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 16:35:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 16:35:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 16:35:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:35:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:35:14,395 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 16:35:14,664 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:35:14,665 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:35:14,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:35:14 BoogieIcfgContainer [2018-12-08 16:35:14,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:35:14,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:35:14,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:35:14,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:35:14,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:35:13" (1/3) ... [2018-12-08 16:35:14,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573440f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:35:14, skipping insertion in model container [2018-12-08 16:35:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:35:14" (2/3) ... [2018-12-08 16:35:14,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573440f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:35:14, skipping insertion in model container [2018-12-08 16:35:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:35:14" (3/3) ... [2018-12-08 16:35:14,670 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_pso.opt_false-unreach-call.i [2018-12-08 16:35:14,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,696 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,709 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:35:14,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 16:35:14,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:35:14,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 16:35:14,741 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 16:35:14,755 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:35:14,755 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 16:35:14,755 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:35:14,755 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:35:14,755 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:35:14,755 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:35:14,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:35:14,756 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:35:14,762 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-08 16:35:15,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-08 16:35:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-08 16:35:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 16:35:15,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:15,925 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] [2018-12-08 16:35:15,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:15,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-08 16:35:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:15,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:15,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:16,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 16:35:16,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:16,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:16,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:16,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:16,084 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-08 16:35:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:16,464 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-08 16:35:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:35:16,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 16:35:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:16,610 INFO L225 Difference]: With dead ends: 47768 [2018-12-08 16:35:16,610 INFO L226 Difference]: Without dead ends: 34608 [2018-12-08 16:35:16,611 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 16:35:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-08 16:35:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-08 16:35:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-08 16:35:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-08 16:35:17,235 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-08 16:35:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:17,235 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-08 16:35:17,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-08 16:35:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 16:35:17,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:17,240 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 16:35:17,241 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:17,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-08 16:35:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:17,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:17,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:17,286 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 16:35:17,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:17,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:17,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:17,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:17,288 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-12-08 16:35:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:17,356 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-12-08 16:35:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:35:17,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 16:35:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:17,371 INFO L225 Difference]: With dead ends: 7170 [2018-12-08 16:35:17,371 INFO L226 Difference]: Without dead ends: 6324 [2018-12-08 16:35:17,371 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 16:35:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-12-08 16:35:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-12-08 16:35:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-12-08 16:35:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-12-08 16:35:17,454 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-12-08 16:35:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:17,455 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-12-08 16:35:17,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-12-08 16:35:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 16:35:17,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:17,456 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 16:35:17,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:17,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1786960607, now seen corresponding path program 1 times [2018-12-08 16:35:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:17,510 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 16:35:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:17,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:35:17,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:17,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:35:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:35:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:35:17,512 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-12-08 16:35:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:17,777 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-12-08 16:35:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:35:17,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 16:35:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:17,796 INFO L225 Difference]: With dead ends: 12020 [2018-12-08 16:35:17,796 INFO L226 Difference]: Without dead ends: 11945 [2018-12-08 16:35:17,797 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 16:35:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-12-08 16:35:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-12-08 16:35:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-12-08 16:35:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-12-08 16:35:17,904 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-12-08 16:35:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:17,904 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-12-08 16:35:17,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:35:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-12-08 16:35:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 16:35:17,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:17,905 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 16:35:17,905 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:17,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-08 16:35:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:17,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:17,928 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 16:35:17,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:35:17,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:17,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:35:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:35:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:35:17,929 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-12-08 16:35:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:17,975 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-12-08 16:35:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:35:17,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 16:35:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:17,989 INFO L225 Difference]: With dead ends: 10985 [2018-12-08 16:35:17,989 INFO L226 Difference]: Without dead ends: 10981 [2018-12-08 16:35:17,989 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 16:35:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-12-08 16:35:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-12-08 16:35:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-12-08 16:35:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-12-08 16:35:18,097 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-12-08 16:35:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:18,097 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-12-08 16:35:18,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:35:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-12-08 16:35:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 16:35:18,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:18,099 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 16:35:18,099 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:18,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-08 16:35:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:18,136 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 16:35:18,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:18,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:18,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:18,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:18,137 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-12-08 16:35:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:18,392 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-12-08 16:35:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:35:18,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 16:35:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:18,406 INFO L225 Difference]: With dead ends: 11923 [2018-12-08 16:35:18,406 INFO L226 Difference]: Without dead ends: 11826 [2018-12-08 16:35:18,406 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 16:35:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-12-08 16:35:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-12-08 16:35:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-12-08 16:35:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-12-08 16:35:18,509 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-12-08 16:35:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:18,509 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-12-08 16:35:18,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-12-08 16:35:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:35:18,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:18,514 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] [2018-12-08 16:35:18,514 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:18,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash -564402918, now seen corresponding path program 1 times [2018-12-08 16:35:18,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:18,561 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 16:35:18,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:18,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:18,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:18,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:18,562 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-12-08 16:35:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:18,703 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-12-08 16:35:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:35:18,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 16:35:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:18,716 INFO L225 Difference]: With dead ends: 10900 [2018-12-08 16:35:18,716 INFO L226 Difference]: Without dead ends: 10900 [2018-12-08 16:35:18,716 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 16:35:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-12-08 16:35:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-12-08 16:35:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-12-08 16:35:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-12-08 16:35:18,816 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-12-08 16:35:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:18,817 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-12-08 16:35:18,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-12-08 16:35:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:35:18,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:18,821 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] [2018-12-08 16:35:18,821 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:18,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1178407417, now seen corresponding path program 1 times [2018-12-08 16:35:18,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:18,866 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 16:35:18,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:35:18,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:35:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:35:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:35:18,867 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 5 states. [2018-12-08 16:35:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:18,893 INFO L93 Difference]: Finished difference Result 2984 states and 7669 transitions. [2018-12-08 16:35:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:35:18,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-08 16:35:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:18,895 INFO L225 Difference]: With dead ends: 2984 [2018-12-08 16:35:18,895 INFO L226 Difference]: Without dead ends: 2432 [2018-12-08 16:35:18,895 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 16:35:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-12-08 16:35:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2314. [2018-12-08 16:35:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2018-12-08 16:35:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 5795 transitions. [2018-12-08 16:35:18,912 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 5795 transitions. Word has length 64 [2018-12-08 16:35:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:18,912 INFO L480 AbstractCegarLoop]: Abstraction has 2314 states and 5795 transitions. [2018-12-08 16:35:18,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:35:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 5795 transitions. [2018-12-08 16:35:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:18,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:18,915 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 16:35:18,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:18,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -285685582, now seen corresponding path program 1 times [2018-12-08 16:35:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:18,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:18,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 16:35:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:18,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:18,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:18,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:18,991 INFO L87 Difference]: Start difference. First operand 2314 states and 5795 transitions. Second operand 6 states. [2018-12-08 16:35:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:19,280 INFO L93 Difference]: Finished difference Result 3320 states and 8247 transitions. [2018-12-08 16:35:19,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:35:19,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 16:35:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:19,282 INFO L225 Difference]: With dead ends: 3320 [2018-12-08 16:35:19,282 INFO L226 Difference]: Without dead ends: 3274 [2018-12-08 16:35:19,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 16:35:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2018-12-08 16:35:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3070. [2018-12-08 16:35:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-12-08 16:35:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 7707 transitions. [2018-12-08 16:35:19,304 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 7707 transitions. Word has length 83 [2018-12-08 16:35:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:19,304 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 7707 transitions. [2018-12-08 16:35:19,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 7707 transitions. [2018-12-08 16:35:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:19,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:19,306 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 16:35:19,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:19,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash -497036495, now seen corresponding path program 1 times [2018-12-08 16:35:19,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:19,373 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 16:35:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:35:19,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:19,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:35:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:35:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:35:19,375 INFO L87 Difference]: Start difference. First operand 3070 states and 7707 transitions. Second operand 7 states. [2018-12-08 16:35:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:19,713 INFO L93 Difference]: Finished difference Result 4860 states and 12238 transitions. [2018-12-08 16:35:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:35:19,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-08 16:35:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:19,717 INFO L225 Difference]: With dead ends: 4860 [2018-12-08 16:35:19,717 INFO L226 Difference]: Without dead ends: 4860 [2018-12-08 16:35:19,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:35:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2018-12-08 16:35:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 3403. [2018-12-08 16:35:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2018-12-08 16:35:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 8551 transitions. [2018-12-08 16:35:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 8551 transitions. Word has length 83 [2018-12-08 16:35:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:19,745 INFO L480 AbstractCegarLoop]: Abstraction has 3403 states and 8551 transitions. [2018-12-08 16:35:19,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:35:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 8551 transitions. [2018-12-08 16:35:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:19,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:19,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:35:19,748 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:19,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:19,748 INFO L82 PathProgramCache]: Analyzing trace with hash 959078899, now seen corresponding path program 1 times [2018-12-08 16:35:19,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:19,779 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 16:35:19,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:19,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:19,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:19,779 INFO L87 Difference]: Start difference. First operand 3403 states and 8551 transitions. Second operand 4 states. [2018-12-08 16:35:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:19,913 INFO L93 Difference]: Finished difference Result 4685 states and 11209 transitions. [2018-12-08 16:35:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:35:19,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 16:35:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:19,917 INFO L225 Difference]: With dead ends: 4685 [2018-12-08 16:35:19,917 INFO L226 Difference]: Without dead ends: 4685 [2018-12-08 16:35:19,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:35:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2018-12-08 16:35:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3531. [2018-12-08 16:35:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3531 states. [2018-12-08 16:35:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 8541 transitions. [2018-12-08 16:35:19,945 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 8541 transitions. Word has length 83 [2018-12-08 16:35:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:19,946 INFO L480 AbstractCegarLoop]: Abstraction has 3531 states and 8541 transitions. [2018-12-08 16:35:19,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 8541 transitions. [2018-12-08 16:35:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:19,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:19,948 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 16:35:19,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:19,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1953894015, now seen corresponding path program 2 times [2018-12-08 16:35:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:19,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:19,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:35:19,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:19,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:19,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:19,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:19,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:19,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:19,994 INFO L87 Difference]: Start difference. First operand 3531 states and 8541 transitions. Second operand 4 states. [2018-12-08 16:35:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:20,102 INFO L93 Difference]: Finished difference Result 4419 states and 10545 transitions. [2018-12-08 16:35:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:35:20,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 16:35:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:20,106 INFO L225 Difference]: With dead ends: 4419 [2018-12-08 16:35:20,106 INFO L226 Difference]: Without dead ends: 4419 [2018-12-08 16:35:20,106 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 16:35:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2018-12-08 16:35:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3566. [2018-12-08 16:35:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3566 states. [2018-12-08 16:35:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 8627 transitions. [2018-12-08 16:35:20,146 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 8627 transitions. Word has length 83 [2018-12-08 16:35:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 3566 states and 8627 transitions. [2018-12-08 16:35:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 8627 transitions. [2018-12-08 16:35:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:20,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:20,150 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 16:35:20,150 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:20,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1614831410, now seen corresponding path program 1 times [2018-12-08 16:35:20,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:35:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:20,228 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 16:35:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:35:20,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:20,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:35:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:35:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:35:20,229 INFO L87 Difference]: Start difference. First operand 3566 states and 8627 transitions. Second operand 5 states. [2018-12-08 16:35:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:20,376 INFO L93 Difference]: Finished difference Result 4787 states and 11368 transitions. [2018-12-08 16:35:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:35:20,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-08 16:35:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:20,379 INFO L225 Difference]: With dead ends: 4787 [2018-12-08 16:35:20,379 INFO L226 Difference]: Without dead ends: 4763 [2018-12-08 16:35:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:35:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2018-12-08 16:35:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 3829. [2018-12-08 16:35:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3829 states. [2018-12-08 16:35:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 9189 transitions. [2018-12-08 16:35:20,418 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 9189 transitions. Word has length 83 [2018-12-08 16:35:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:20,418 INFO L480 AbstractCegarLoop]: Abstraction has 3829 states and 9189 transitions. [2018-12-08 16:35:20,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:35:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 9189 transitions. [2018-12-08 16:35:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:20,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:20,422 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 16:35:20,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:20,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1380210314, now seen corresponding path program 2 times [2018-12-08 16:35:20,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:20,502 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 16:35:20,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:20,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:35:20,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:20,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:35:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:35:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:35:20,504 INFO L87 Difference]: Start difference. First operand 3829 states and 9189 transitions. Second operand 4 states. [2018-12-08 16:35:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:20,560 INFO L93 Difference]: Finished difference Result 4037 states and 9725 transitions. [2018-12-08 16:35:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:35:20,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 16:35:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:20,563 INFO L225 Difference]: With dead ends: 4037 [2018-12-08 16:35:20,563 INFO L226 Difference]: Without dead ends: 4037 [2018-12-08 16:35:20,563 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 16:35:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2018-12-08 16:35:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3893. [2018-12-08 16:35:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2018-12-08 16:35:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 9365 transitions. [2018-12-08 16:35:20,591 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 9365 transitions. Word has length 83 [2018-12-08 16:35:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:20,592 INFO L480 AbstractCegarLoop]: Abstraction has 3893 states and 9365 transitions. [2018-12-08 16:35:20,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:35:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 9365 transitions. [2018-12-08 16:35:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:20,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:20,595 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 16:35:20,595 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:20,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash -427244149, now seen corresponding path program 1 times [2018-12-08 16:35:20,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:20,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:35:20,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:20,663 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 16:35:20,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:20,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:20,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:20,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:20,664 INFO L87 Difference]: Start difference. First operand 3893 states and 9365 transitions. Second operand 6 states. [2018-12-08 16:35:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:20,848 INFO L93 Difference]: Finished difference Result 5120 states and 12287 transitions. [2018-12-08 16:35:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:35:20,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 16:35:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:20,851 INFO L225 Difference]: With dead ends: 5120 [2018-12-08 16:35:20,852 INFO L226 Difference]: Without dead ends: 5088 [2018-12-08 16:35:20,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 16:35:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2018-12-08 16:35:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 4684. [2018-12-08 16:35:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-08 16:35:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 11313 transitions. [2018-12-08 16:35:20,886 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 11313 transitions. Word has length 83 [2018-12-08 16:35:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 11313 transitions. [2018-12-08 16:35:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 11313 transitions. [2018-12-08 16:35:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:20,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:20,889 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 16:35:20,889 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:20,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2070771788, now seen corresponding path program 1 times [2018-12-08 16:35:20,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:20,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:20,929 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 16:35:20,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:20,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:35:20,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:20,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:35:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:35:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:35:20,930 INFO L87 Difference]: Start difference. First operand 4684 states and 11313 transitions. Second operand 7 states. [2018-12-08 16:35:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:21,272 INFO L93 Difference]: Finished difference Result 7839 states and 19150 transitions. [2018-12-08 16:35:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:35:21,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-08 16:35:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:21,278 INFO L225 Difference]: With dead ends: 7839 [2018-12-08 16:35:21,278 INFO L226 Difference]: Without dead ends: 7839 [2018-12-08 16:35:21,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:35:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7839 states. [2018-12-08 16:35:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7839 to 5450. [2018-12-08 16:35:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5450 states. [2018-12-08 16:35:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5450 states to 5450 states and 13284 transitions. [2018-12-08 16:35:21,325 INFO L78 Accepts]: Start accepts. Automaton has 5450 states and 13284 transitions. Word has length 83 [2018-12-08 16:35:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:21,326 INFO L480 AbstractCegarLoop]: Abstraction has 5450 states and 13284 transitions. [2018-12-08 16:35:21,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:35:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5450 states and 13284 transitions. [2018-12-08 16:35:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:21,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:21,330 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 16:35:21,330 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:21,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1336691827, now seen corresponding path program 1 times [2018-12-08 16:35:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:21,389 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 16:35:21,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:21,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:21,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:21,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:21,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:21,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:21,390 INFO L87 Difference]: Start difference. First operand 5450 states and 13284 transitions. Second operand 6 states. [2018-12-08 16:35:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:21,599 INFO L93 Difference]: Finished difference Result 5494 states and 13344 transitions. [2018-12-08 16:35:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:35:21,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 16:35:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:21,603 INFO L225 Difference]: With dead ends: 5494 [2018-12-08 16:35:21,603 INFO L226 Difference]: Without dead ends: 5494 [2018-12-08 16:35:21,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:35:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2018-12-08 16:35:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 4348. [2018-12-08 16:35:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4348 states. [2018-12-08 16:35:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 10496 transitions. [2018-12-08 16:35:21,639 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 10496 transitions. Word has length 83 [2018-12-08 16:35:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:21,639 INFO L480 AbstractCegarLoop]: Abstraction has 4348 states and 10496 transitions. [2018-12-08 16:35:21,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 10496 transitions. [2018-12-08 16:35:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:21,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:21,644 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 16:35:21,645 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:21,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -858977808, now seen corresponding path program 1 times [2018-12-08 16:35:21,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:21,703 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 16:35:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:21,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:21,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:21,704 INFO L87 Difference]: Start difference. First operand 4348 states and 10496 transitions. Second operand 6 states. [2018-12-08 16:35:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:21,826 INFO L93 Difference]: Finished difference Result 4312 states and 10362 transitions. [2018-12-08 16:35:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:35:21,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 16:35:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:21,830 INFO L225 Difference]: With dead ends: 4312 [2018-12-08 16:35:21,830 INFO L226 Difference]: Without dead ends: 4312 [2018-12-08 16:35:21,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2018-12-08 16:35:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4112. [2018-12-08 16:35:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4112 states. [2018-12-08 16:35:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 9883 transitions. [2018-12-08 16:35:21,860 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 9883 transitions. Word has length 83 [2018-12-08 16:35:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:21,860 INFO L480 AbstractCegarLoop]: Abstraction has 4112 states and 9883 transitions. [2018-12-08 16:35:21,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 9883 transitions. [2018-12-08 16:35:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 16:35:21,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:21,863 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 16:35:21,864 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:21,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash 510429518, now seen corresponding path program 1 times [2018-12-08 16:35:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:21,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:21,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 16:35:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:21,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:21,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:21,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:21,932 INFO L87 Difference]: Start difference. First operand 4112 states and 9883 transitions. Second operand 6 states. [2018-12-08 16:35:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:22,019 INFO L93 Difference]: Finished difference Result 3808 states and 8899 transitions. [2018-12-08 16:35:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:35:22,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 16:35:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:22,022 INFO L225 Difference]: With dead ends: 3808 [2018-12-08 16:35:22,022 INFO L226 Difference]: Without dead ends: 3808 [2018-12-08 16:35:22,022 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 16:35:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2018-12-08 16:35:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 2662. [2018-12-08 16:35:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2018-12-08 16:35:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 6203 transitions. [2018-12-08 16:35:22,045 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 6203 transitions. Word has length 83 [2018-12-08 16:35:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 2662 states and 6203 transitions. [2018-12-08 16:35:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 6203 transitions. [2018-12-08 16:35:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:22,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:22,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:35:22,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:22,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1521481755, now seen corresponding path program 1 times [2018-12-08 16:35:22,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:22,106 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 16:35:22,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:22,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:35:22,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:22,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:35:22,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:35:22,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:22,107 INFO L87 Difference]: Start difference. First operand 2662 states and 6203 transitions. Second operand 6 states. [2018-12-08 16:35:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:22,259 INFO L93 Difference]: Finished difference Result 2899 states and 6633 transitions. [2018-12-08 16:35:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:35:22,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-08 16:35:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:22,262 INFO L225 Difference]: With dead ends: 2899 [2018-12-08 16:35:22,263 INFO L226 Difference]: Without dead ends: 2899 [2018-12-08 16:35:22,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:35:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-12-08 16:35:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2679. [2018-12-08 16:35:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2679 states. [2018-12-08 16:35:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 6167 transitions. [2018-12-08 16:35:22,292 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 6167 transitions. Word has length 85 [2018-12-08 16:35:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:22,292 INFO L480 AbstractCegarLoop]: Abstraction has 2679 states and 6167 transitions. [2018-12-08 16:35:22,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:35:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 6167 transitions. [2018-12-08 16:35:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:22,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:22,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:35:22,296 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:22,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1732832668, now seen corresponding path program 1 times [2018-12-08 16:35:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:22,409 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 16:35:22,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:22,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:35:22,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:22,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:35:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:35:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:35:22,410 INFO L87 Difference]: Start difference. First operand 2679 states and 6167 transitions. Second operand 7 states. [2018-12-08 16:35:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:22,533 INFO L93 Difference]: Finished difference Result 3187 states and 7323 transitions. [2018-12-08 16:35:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:35:22,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-08 16:35:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:22,536 INFO L225 Difference]: With dead ends: 3187 [2018-12-08 16:35:22,536 INFO L226 Difference]: Without dead ends: 3187 [2018-12-08 16:35:22,536 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 16:35:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2018-12-08 16:35:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3171. [2018-12-08 16:35:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2018-12-08 16:35:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 7283 transitions. [2018-12-08 16:35:22,558 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 7283 transitions. Word has length 85 [2018-12-08 16:35:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:22,559 INFO L480 AbstractCegarLoop]: Abstraction has 3171 states and 7283 transitions. [2018-12-08 16:35:22,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:35:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 7283 transitions. [2018-12-08 16:35:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:22,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:22,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:35:22,562 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:22,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1674630947, now seen corresponding path program 1 times [2018-12-08 16:35:22,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:22,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:22,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 16:35:22,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:22,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 16:35:22,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:22,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 16:35:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 16:35:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 16:35:22,676 INFO L87 Difference]: Start difference. First operand 3171 states and 7283 transitions. Second operand 10 states. [2018-12-08 16:35:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:23,041 INFO L93 Difference]: Finished difference Result 5653 states and 13108 transitions. [2018-12-08 16:35:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:35:23,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-08 16:35:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:23,043 INFO L225 Difference]: With dead ends: 5653 [2018-12-08 16:35:23,043 INFO L226 Difference]: Without dead ends: 2325 [2018-12-08 16:35:23,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-08 16:35:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-08 16:35:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2325. [2018-12-08 16:35:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2018-12-08 16:35:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 5392 transitions. [2018-12-08 16:35:23,059 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 5392 transitions. Word has length 85 [2018-12-08 16:35:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:23,060 INFO L480 AbstractCegarLoop]: Abstraction has 2325 states and 5392 transitions. [2018-12-08 16:35:23,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 16:35:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 5392 transitions. [2018-12-08 16:35:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:23,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:23,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:35:23,062 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:23,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash -105147112, now seen corresponding path program 2 times [2018-12-08 16:35:23,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:35:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:23,114 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 16:35:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:35:23,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:23,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:35:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:35:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:35:23,115 INFO L87 Difference]: Start difference. First operand 2325 states and 5392 transitions. Second operand 5 states. [2018-12-08 16:35:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:23,139 INFO L93 Difference]: Finished difference Result 2325 states and 5376 transitions. [2018-12-08 16:35:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:35:23,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-08 16:35:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:23,141 INFO L225 Difference]: With dead ends: 2325 [2018-12-08 16:35:23,141 INFO L226 Difference]: Without dead ends: 2325 [2018-12-08 16:35:23,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:35:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-08 16:35:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1860. [2018-12-08 16:35:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2018-12-08 16:35:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 4326 transitions. [2018-12-08 16:35:23,153 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 4326 transitions. Word has length 85 [2018-12-08 16:35:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:23,154 INFO L480 AbstractCegarLoop]: Abstraction has 1860 states and 4326 transitions. [2018-12-08 16:35:23,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:35:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 4326 transitions. [2018-12-08 16:35:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:23,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:23,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:35:23,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:23,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 782356569, now seen corresponding path program 2 times [2018-12-08 16:35:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:23,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:35:23,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:35:23,243 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 16:35:23,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:35:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 16:35:23,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:35:23,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 16:35:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 16:35:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:35:23,244 INFO L87 Difference]: Start difference. First operand 1860 states and 4326 transitions. Second operand 11 states. [2018-12-08 16:35:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:35:23,730 INFO L93 Difference]: Finished difference Result 3500 states and 8182 transitions. [2018-12-08 16:35:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:35:23,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-08 16:35:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:35:23,732 INFO L225 Difference]: With dead ends: 3500 [2018-12-08 16:35:23,732 INFO L226 Difference]: Without dead ends: 2091 [2018-12-08 16:35:23,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-08 16:35:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-08 16:35:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1897. [2018-12-08 16:35:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2018-12-08 16:35:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4355 transitions. [2018-12-08 16:35:23,746 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4355 transitions. Word has length 85 [2018-12-08 16:35:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:35:23,746 INFO L480 AbstractCegarLoop]: Abstraction has 1897 states and 4355 transitions. [2018-12-08 16:35:23,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 16:35:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4355 transitions. [2018-12-08 16:35:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 16:35:23,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:35:23,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:35:23,748 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:35:23,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:35:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 3 times [2018-12-08 16:35:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:35:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:35:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:35:23,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:35:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:35:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:35:23,780 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:35:23,840 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 16:35:23,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:35:23 BasicIcfg [2018-12-08 16:35:23,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:35:23,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:35:23,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:35:23,842 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:35:23,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:35:14" (3/4) ... [2018-12-08 16:35:23,843 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 16:35:23,908 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6dd87417-40e8-4733-9803-a2f59b66bc4a/bin-2019/utaipan/witness.graphml [2018-12-08 16:35:23,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:35:23,909 INFO L168 Benchmark]: Toolchain (without parser) took 9953.67 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 948.1 MB in the beginning and 1.3 GB in the end (delta: -327.7 MB). Peak memory consumption was 674.2 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,910 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:35:23,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,910 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 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 16:35:23,910 INFO L168 Benchmark]: RCFGBuilder took 306.95 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: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,911 INFO L168 Benchmark]: TraceAbstraction took 9175.54 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -245.9 MB). Peak memory consumption was 609.3 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,911 INFO L168 Benchmark]: Witness Printer took 66.84 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-12-08 16:35:23,912 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.14 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 306.95 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: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9175.54 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -245.9 MB). Peak memory consumption was 609.3 MB. Max. memory is 11.5 GB. * Witness Printer took 66.84 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L778] -1 pthread_t t1657; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L779] FCALL, FORK -1 pthread_create(&t1657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L780] -1 pthread_t t1658; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L781] FCALL, FORK -1 pthread_create(&t1658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 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 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 9.0s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5401 SDtfs, 6082 SDslu, 12884 SDs, 0 SdLazy, 4918 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 54 SyntacticMatches, 16 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27856occurred 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: 1.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 33539 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1681 ConstructedInterpolants, 0 QuantifiedInterpolants, 335581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...