./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/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 a697edfe042240cd4f596c03e6214ca7451405ac .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 05:48:11,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:48:11,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:48:11,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:48:11,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:48:11,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:48:11,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:48:11,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:48:11,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:48:11,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:48:11,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:48:11,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:48:11,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:48:11,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:48:11,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:48:11,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:48:11,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:48:11,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:48:11,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:48:11,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:48:11,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:48:11,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:48:11,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:48:11,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:48:11,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:48:11,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:48:11,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:48:11,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:48:11,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:48:11,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:48:11,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:48:11,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:48:11,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:48:11,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:48:11,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:48:11,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:48:11,438 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:48:11,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:48:11,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:48:11,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:48:11,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:48:11,448 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:48:11,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:48:11,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:48:11,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:48:11,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:48:11,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:48:11,451 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:48:11,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:48:11,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:48:11,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:48:11,452 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_acb30aac-1755-47e3-be4c-57e5c08527ce/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 -> a697edfe042240cd4f596c03e6214ca7451405ac [2018-12-03 05:48:11,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:48:11,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:48:11,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:48:11,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:48:11,484 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:48:11,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-12-03 05:48:11,518 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/data/d6a5e1fb8/22dfc7e2d72242a391fd460a5a068dcb/FLAGa664561f7 [2018-12-03 05:48:11,942 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:48:11,942 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/sv-benchmarks/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-12-03 05:48:11,949 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/data/d6a5e1fb8/22dfc7e2d72242a391fd460a5a068dcb/FLAGa664561f7 [2018-12-03 05:48:11,957 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/data/d6a5e1fb8/22dfc7e2d72242a391fd460a5a068dcb [2018-12-03 05:48:11,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:48:11,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:48:11,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:48:11,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:48:11,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:48:11,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:48:11" (1/1) ... [2018-12-03 05:48:11,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:11, skipping insertion in model container [2018-12-03 05:48:11,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:48:11" (1/1) ... [2018-12-03 05:48:11,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:48:11,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:48:12,166 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:48:12,174 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:48:12,257 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:48:12,293 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:48:12,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12 WrapperNode [2018-12-03 05:48:12,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:48:12,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:48:12,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:48:12,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:48:12,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:48:12,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:48:12,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:48:12,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:48:12,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... [2018-12-03 05:48:12,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:48:12,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:48:12,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:48:12,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:48:12,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/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-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 05:48:12,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 05:48:12,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 05:48:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 05:48:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:48:12,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:48:12,411 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 05:48:12,726 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:48:12,727 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 05:48:12,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:12 BoogieIcfgContainer [2018-12-03 05:48:12,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:48:12,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:48:12,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:48:12,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:48:12,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:48:11" (1/3) ... [2018-12-03 05:48:12,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400413f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:48:12, skipping insertion in model container [2018-12-03 05:48:12,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:12" (2/3) ... [2018-12-03 05:48:12,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400413f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:48:12, skipping insertion in model container [2018-12-03 05:48:12,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:12" (3/3) ... [2018-12-03 05:48:12,732 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc_false-unreach-call.i [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:48:12,770 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 05:48:12,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:48:12,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 05:48:12,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 05:48:12,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:48:12,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:48:12,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:48:12,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:48:12,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:48:12,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:48:12,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:48:12,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:48:12,815 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-03 05:48:13,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-12-03 05:48:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-12-03 05:48:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 05:48:13,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:13,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:13,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:13,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-12-03 05:48:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:13,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:13,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:13,883 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-03 05:48:13,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:13,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:13,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:13,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:13,897 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-12-03 05:48:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:14,243 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-12-03 05:48:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:48:14,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-03 05:48:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:14,402 INFO L225 Difference]: With dead ends: 45394 [2018-12-03 05:48:14,402 INFO L226 Difference]: Without dead ends: 40634 [2018-12-03 05:48:14,403 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-03 05:48:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-12-03 05:48:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-12-03 05:48:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-12-03 05:48:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-12-03 05:48:15,100 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-12-03 05:48:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:15,101 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-12-03 05:48:15,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-12-03 05:48:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 05:48:15,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:15,104 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] [2018-12-03 05:48:15,104 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:15,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-12-03 05:48:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:15,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:15,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:15,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:15,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:15,162 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-03 05:48:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:15,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:15,165 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-12-03 05:48:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:15,773 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-12-03 05:48:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:48:15,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-03 05:48:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:15,905 INFO L225 Difference]: With dead ends: 64836 [2018-12-03 05:48:15,906 INFO L226 Difference]: Without dead ends: 64676 [2018-12-03 05:48:15,906 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-03 05:48:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-12-03 05:48:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-12-03 05:48:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-12-03 05:48:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-12-03 05:48:16,653 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-12-03 05:48:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:16,654 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-12-03 05:48:16,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-12-03 05:48:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 05:48:16,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:16,656 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] [2018-12-03 05:48:16,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:16,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-12-03 05:48:16,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:16,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:16,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:16,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:16,696 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-03 05:48:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:16,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:16,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:16,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:16,697 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-12-03 05:48:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:16,734 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-12-03 05:48:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:16,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 05:48:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:16,756 INFO L225 Difference]: With dead ends: 12370 [2018-12-03 05:48:16,756 INFO L226 Difference]: Without dead ends: 11849 [2018-12-03 05:48:16,756 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-03 05:48:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-12-03 05:48:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-12-03 05:48:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-12-03 05:48:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-12-03 05:48:16,886 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-12-03 05:48:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:16,886 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-12-03 05:48:16,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-12-03 05:48:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:48:16,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:16,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] [2018-12-03 05:48:16,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:16,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-12-03 05:48:16,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:16,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:16,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:16,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:16,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:16,948 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-03 05:48:16,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:16,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:16,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:16,949 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-12-03 05:48:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:17,113 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-12-03 05:48:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:17,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 05:48:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:17,136 INFO L225 Difference]: With dead ends: 17025 [2018-12-03 05:48:17,136 INFO L226 Difference]: Without dead ends: 17025 [2018-12-03 05:48:17,136 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-03 05:48:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-12-03 05:48:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-12-03 05:48:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-12-03 05:48:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-12-03 05:48:17,336 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-12-03 05:48:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:17,337 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-12-03 05:48:17,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-12-03 05:48:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:48:17,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:17,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:17,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:17,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-12-03 05:48:17,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:17,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:17,391 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-03 05:48:17,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:17,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:17,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:17,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:17,392 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-12-03 05:48:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:17,818 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-12-03 05:48:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:17,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 05:48:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:17,840 INFO L225 Difference]: With dead ends: 18380 [2018-12-03 05:48:17,840 INFO L226 Difference]: Without dead ends: 18380 [2018-12-03 05:48:17,840 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-03 05:48:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-03 05:48:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-12-03 05:48:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-12-03 05:48:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-12-03 05:48:18,023 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-12-03 05:48:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:18,023 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-12-03 05:48:18,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-12-03 05:48:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:48:18,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:18,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:18,026 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:18,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-12-03 05:48:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:18,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:18,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:18,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:18,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:18,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:18,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:18,109 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-12-03 05:48:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:18,370 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-12-03 05:48:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:48:18,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-03 05:48:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:18,391 INFO L225 Difference]: With dead ends: 17857 [2018-12-03 05:48:18,391 INFO L226 Difference]: Without dead ends: 17857 [2018-12-03 05:48:18,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:48:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-12-03 05:48:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-12-03 05:48:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-12-03 05:48:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-12-03 05:48:18,566 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-12-03 05:48:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:18,567 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-12-03 05:48:18,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-12-03 05:48:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:48:18,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:18,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:18,570 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-12-03 05:48:18,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:18,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:18,620 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-03 05:48:18,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:18,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:18,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:18,621 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-12-03 05:48:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:18,966 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-12-03 05:48:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:48:18,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-03 05:48:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:18,999 INFO L225 Difference]: With dead ends: 23475 [2018-12-03 05:48:18,999 INFO L226 Difference]: Without dead ends: 23443 [2018-12-03 05:48:19,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:48:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-12-03 05:48:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-12-03 05:48:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-12-03 05:48:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-12-03 05:48:19,272 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-12-03 05:48:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:19,272 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-12-03 05:48:19,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-12-03 05:48:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 05:48:19,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:19,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:19,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:19,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:19,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-12-03 05:48:19,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:19,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:19,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:19,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:19,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:19,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:19,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:19,349 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-12-03 05:48:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:19,775 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-12-03 05:48:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 05:48:19,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-03 05:48:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:19,803 INFO L225 Difference]: With dead ends: 24535 [2018-12-03 05:48:19,803 INFO L226 Difference]: Without dead ends: 24471 [2018-12-03 05:48:19,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-03 05:48:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-12-03 05:48:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-12-03 05:48:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-12-03 05:48:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-12-03 05:48:20,041 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-12-03 05:48:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:20,041 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-12-03 05:48:20,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-12-03 05:48:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 05:48:20,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:20,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:20,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:20,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-12-03 05:48:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:20,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:20,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:20,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:20,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:20,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:20,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:20,079 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-12-03 05:48:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:20,174 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-12-03 05:48:20,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:20,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-03 05:48:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:20,203 INFO L225 Difference]: With dead ends: 24947 [2018-12-03 05:48:20,204 INFO L226 Difference]: Without dead ends: 24947 [2018-12-03 05:48:20,204 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-03 05:48:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-12-03 05:48:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-12-03 05:48:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-12-03 05:48:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-12-03 05:48:20,478 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-12-03 05:48:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-12-03 05:48:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-12-03 05:48:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 05:48:20,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:20,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:20,497 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:20,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-12-03 05:48:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:20,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:20,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:20,537 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-03 05:48:20,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:20,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:20,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:20,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:20,538 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-12-03 05:48:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:20,840 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-12-03 05:48:20,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:20,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-03 05:48:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:20,889 INFO L225 Difference]: With dead ends: 34667 [2018-12-03 05:48:20,889 INFO L226 Difference]: Without dead ends: 34471 [2018-12-03 05:48:20,890 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-03 05:48:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-12-03 05:48:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-12-03 05:48:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-12-03 05:48:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-12-03 05:48:21,306 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-12-03 05:48:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:21,307 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-12-03 05:48:21,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-12-03 05:48:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 05:48:21,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:21,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:21,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:21,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-12-03 05:48:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:21,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:21,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:21,398 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-03 05:48:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:21,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:21,399 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-12-03 05:48:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:21,877 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-12-03 05:48:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:48:21,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-12-03 05:48:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:21,945 INFO L225 Difference]: With dead ends: 52152 [2018-12-03 05:48:21,945 INFO L226 Difference]: Without dead ends: 51912 [2018-12-03 05:48:21,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:48:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-12-03 05:48:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-12-03 05:48:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-12-03 05:48:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-12-03 05:48:22,455 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-12-03 05:48:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-12-03 05:48:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-12-03 05:48:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 05:48:22,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:22,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:22,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:22,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-12-03 05:48:22,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:22,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:22,526 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-12-03 05:48:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:22,549 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-12-03 05:48:22,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:48:22,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-03 05:48:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:22,553 INFO L225 Difference]: With dead ends: 5456 [2018-12-03 05:48:22,553 INFO L226 Difference]: Without dead ends: 4832 [2018-12-03 05:48:22,553 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-03 05:48:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-12-03 05:48:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-12-03 05:48:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-03 05:48:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-12-03 05:48:22,587 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-12-03 05:48:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:22,587 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-12-03 05:48:22,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-12-03 05:48:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 05:48:22,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:22,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:22,590 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:22,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-12-03 05:48:22,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:22,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:22,636 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-03 05:48:22,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:22,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:22,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:22,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:22,637 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-12-03 05:48:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:22,758 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-12-03 05:48:22,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:48:22,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 05:48:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:22,762 INFO L225 Difference]: With dead ends: 5468 [2018-12-03 05:48:22,762 INFO L226 Difference]: Without dead ends: 5440 [2018-12-03 05:48:22,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:48:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-03 05:48:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-12-03 05:48:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-03 05:48:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-12-03 05:48:22,799 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-12-03 05:48:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:22,799 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-12-03 05:48:22,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-12-03 05:48:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 05:48:22,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:22,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:22,803 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:22,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:22,803 INFO L82 PathProgramCache]: Analyzing trace with hash 222666796, now seen corresponding path program 1 times [2018-12-03 05:48:22,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:22,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:22,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:22,837 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-03 05:48:22,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:22,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:22,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:22,838 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-12-03 05:48:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:22,911 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-12-03 05:48:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:22,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-03 05:48:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:22,915 INFO L225 Difference]: With dead ends: 5440 [2018-12-03 05:48:22,915 INFO L226 Difference]: Without dead ends: 5440 [2018-12-03 05:48:22,916 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-03 05:48:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-03 05:48:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-12-03 05:48:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-12-03 05:48:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-12-03 05:48:22,951 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-12-03 05:48:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:22,951 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-12-03 05:48:22,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-12-03 05:48:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:22,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:22,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:22,956 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:22,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash -602105678, now seen corresponding path program 1 times [2018-12-03 05:48:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:22,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:22,986 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-03 05:48:22,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:22,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:22,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:22,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:22,987 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 5 states. [2018-12-03 05:48:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:23,164 INFO L93 Difference]: Finished difference Result 5683 states and 14775 transitions. [2018-12-03 05:48:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:23,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 05:48:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:23,169 INFO L225 Difference]: With dead ends: 5683 [2018-12-03 05:48:23,169 INFO L226 Difference]: Without dead ends: 5683 [2018-12-03 05:48:23,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2018-12-03 05:48:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5398. [2018-12-03 05:48:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2018-12-03 05:48:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 14084 transitions. [2018-12-03 05:48:23,209 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 14084 transitions. Word has length 91 [2018-12-03 05:48:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:23,209 INFO L480 AbstractCegarLoop]: Abstraction has 5398 states and 14084 transitions. [2018-12-03 05:48:23,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 14084 transitions. [2018-12-03 05:48:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:23,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:23,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:23,213 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:23,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 531084915, now seen corresponding path program 1 times [2018-12-03 05:48:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:23,239 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-03 05:48:23,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:23,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:48:23,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:23,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:48:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:48:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:48:23,240 INFO L87 Difference]: Start difference. First operand 5398 states and 14084 transitions. Second operand 4 states. [2018-12-03 05:48:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:23,400 INFO L93 Difference]: Finished difference Result 11568 states and 30967 transitions. [2018-12-03 05:48:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:23,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-03 05:48:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:23,409 INFO L225 Difference]: With dead ends: 11568 [2018-12-03 05:48:23,409 INFO L226 Difference]: Without dead ends: 11519 [2018-12-03 05:48:23,410 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-03 05:48:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2018-12-03 05:48:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 5140. [2018-12-03 05:48:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-12-03 05:48:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13373 transitions. [2018-12-03 05:48:23,468 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13373 transitions. Word has length 91 [2018-12-03 05:48:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:23,468 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13373 transitions. [2018-12-03 05:48:23,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:48:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13373 transitions. [2018-12-03 05:48:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:23,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:23,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:48:23,471 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:23,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1618352203, now seen corresponding path program 1 times [2018-12-03 05:48:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:23,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:23,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:23,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:23,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:23,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:23,544 INFO L87 Difference]: Start difference. First operand 5140 states and 13373 transitions. Second operand 6 states. [2018-12-03 05:48:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:23,677 INFO L93 Difference]: Finished difference Result 6850 states and 17496 transitions. [2018-12-03 05:48:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:48:23,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 05:48:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:23,683 INFO L225 Difference]: With dead ends: 6850 [2018-12-03 05:48:23,683 INFO L226 Difference]: Without dead ends: 6818 [2018-12-03 05:48:23,683 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-03 05:48:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2018-12-03 05:48:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 5615. [2018-12-03 05:48:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2018-12-03 05:48:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 14463 transitions. [2018-12-03 05:48:23,731 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 14463 transitions. Word has length 91 [2018-12-03 05:48:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:23,731 INFO L480 AbstractCegarLoop]: Abstraction has 5615 states and 14463 transitions. [2018-12-03 05:48:23,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 14463 transitions. [2018-12-03 05:48:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:23,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:23,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:23,734 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:23,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:23,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1901502667, now seen corresponding path program 1 times [2018-12-03 05:48:23,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:23,783 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-03 05:48:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:23,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:23,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:23,784 INFO L87 Difference]: Start difference. First operand 5615 states and 14463 transitions. Second operand 7 states. [2018-12-03 05:48:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:24,068 INFO L93 Difference]: Finished difference Result 11651 states and 30335 transitions. [2018-12-03 05:48:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:48:24,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 05:48:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:24,077 INFO L225 Difference]: With dead ends: 11651 [2018-12-03 05:48:24,077 INFO L226 Difference]: Without dead ends: 11651 [2018-12-03 05:48:24,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:48:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2018-12-03 05:48:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 6113. [2018-12-03 05:48:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2018-12-03 05:48:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 15768 transitions. [2018-12-03 05:48:24,140 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 15768 transitions. Word has length 91 [2018-12-03 05:48:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 6113 states and 15768 transitions. [2018-12-03 05:48:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 15768 transitions. [2018-12-03 05:48:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:24,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:24,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:24,144 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:24,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:24,145 INFO L82 PathProgramCache]: Analyzing trace with hash -656738186, now seen corresponding path program 1 times [2018-12-03 05:48:24,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:24,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:24,203 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-03 05:48:24,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:24,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:24,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:24,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:24,204 INFO L87 Difference]: Start difference. First operand 6113 states and 15768 transitions. Second operand 5 states. [2018-12-03 05:48:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:24,237 INFO L93 Difference]: Finished difference Result 9700 states and 25509 transitions. [2018-12-03 05:48:24,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:48:24,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 05:48:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:24,245 INFO L225 Difference]: With dead ends: 9700 [2018-12-03 05:48:24,245 INFO L226 Difference]: Without dead ends: 9700 [2018-12-03 05:48:24,246 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-03 05:48:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2018-12-03 05:48:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 5539. [2018-12-03 05:48:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2018-12-03 05:48:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 14328 transitions. [2018-12-03 05:48:24,300 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 14328 transitions. Word has length 91 [2018-12-03 05:48:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 5539 states and 14328 transitions. [2018-12-03 05:48:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 14328 transitions. [2018-12-03 05:48:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:24,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:24,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:24,303 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:24,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1702568823, now seen corresponding path program 1 times [2018-12-03 05:48:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:24,366 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-03 05:48:24,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:24,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:24,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:24,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:24,367 INFO L87 Difference]: Start difference. First operand 5539 states and 14328 transitions. Second operand 6 states. [2018-12-03 05:48:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:24,407 INFO L93 Difference]: Finished difference Result 8960 states and 23608 transitions. [2018-12-03 05:48:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:48:24,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 05:48:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:24,413 INFO L225 Difference]: With dead ends: 8960 [2018-12-03 05:48:24,414 INFO L226 Difference]: Without dead ends: 8960 [2018-12-03 05:48:24,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2018-12-03 05:48:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 5227. [2018-12-03 05:48:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2018-12-03 05:48:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 13455 transitions. [2018-12-03 05:48:24,460 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 13455 transitions. Word has length 91 [2018-12-03 05:48:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:24,460 INFO L480 AbstractCegarLoop]: Abstraction has 5227 states and 13455 transitions. [2018-12-03 05:48:24,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 13455 transitions. [2018-12-03 05:48:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 05:48:24,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:24,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:24,463 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:24,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2111682057, now seen corresponding path program 1 times [2018-12-03 05:48:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:24,523 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-03 05:48:24,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:24,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:48:24,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:24,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:48:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:48:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:48:24,524 INFO L87 Difference]: Start difference. First operand 5227 states and 13455 transitions. Second operand 6 states. [2018-12-03 05:48:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:24,641 INFO L93 Difference]: Finished difference Result 4523 states and 11391 transitions. [2018-12-03 05:48:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:48:24,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 05:48:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:24,645 INFO L225 Difference]: With dead ends: 4523 [2018-12-03 05:48:24,645 INFO L226 Difference]: Without dead ends: 4523 [2018-12-03 05:48:24,645 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-03 05:48:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2018-12-03 05:48:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 3659. [2018-12-03 05:48:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2018-12-03 05:48:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 9437 transitions. [2018-12-03 05:48:24,675 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 9437 transitions. Word has length 91 [2018-12-03 05:48:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 9437 transitions. [2018-12-03 05:48:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:48:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 9437 transitions. [2018-12-03 05:48:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:24,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:24,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:24,677 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:24,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash -879974516, now seen corresponding path program 1 times [2018-12-03 05:48:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:24,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:24,740 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-03 05:48:24,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:24,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 05:48:24,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:24,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:48:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:48:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:48:24,741 INFO L87 Difference]: Start difference. First operand 3659 states and 9437 transitions. Second operand 8 states. [2018-12-03 05:48:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:24,987 INFO L93 Difference]: Finished difference Result 5920 states and 14721 transitions. [2018-12-03 05:48:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:48:24,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-03 05:48:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:24,991 INFO L225 Difference]: With dead ends: 5920 [2018-12-03 05:48:24,992 INFO L226 Difference]: Without dead ends: 5888 [2018-12-03 05:48:24,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:48:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2018-12-03 05:48:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4271. [2018-12-03 05:48:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-03 05:48:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10898 transitions. [2018-12-03 05:48:25,025 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10898 transitions. Word has length 93 [2018-12-03 05:48:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:25,025 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10898 transitions. [2018-12-03 05:48:25,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:48:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10898 transitions. [2018-12-03 05:48:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:25,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:25,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:25,027 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 364789965, now seen corresponding path program 1 times [2018-12-03 05:48:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:25,131 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-03 05:48:25,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:25,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:25,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:25,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:25,132 INFO L87 Difference]: Start difference. First operand 4271 states and 10898 transitions. Second operand 7 states. [2018-12-03 05:48:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:25,210 INFO L93 Difference]: Finished difference Result 3981 states and 10019 transitions. [2018-12-03 05:48:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:48:25,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-03 05:48:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:25,213 INFO L225 Difference]: With dead ends: 3981 [2018-12-03 05:48:25,213 INFO L226 Difference]: Without dead ends: 3981 [2018-12-03 05:48:25,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:48:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-12-03 05:48:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3690. [2018-12-03 05:48:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2018-12-03 05:48:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 9463 transitions. [2018-12-03 05:48:25,242 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 9463 transitions. Word has length 93 [2018-12-03 05:48:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:25,242 INFO L480 AbstractCegarLoop]: Abstraction has 3690 states and 9463 transitions. [2018-12-03 05:48:25,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 9463 transitions. [2018-12-03 05:48:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:25,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:25,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:25,245 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:25,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash -550208755, now seen corresponding path program 1 times [2018-12-03 05:48:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:25,298 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-03 05:48:25,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:25,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:25,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:25,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:25,298 INFO L87 Difference]: Start difference. First operand 3690 states and 9463 transitions. Second operand 7 states. [2018-12-03 05:48:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:25,426 INFO L93 Difference]: Finished difference Result 4149 states and 10417 transitions. [2018-12-03 05:48:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:48:25,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-03 05:48:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:25,431 INFO L225 Difference]: With dead ends: 4149 [2018-12-03 05:48:25,431 INFO L226 Difference]: Without dead ends: 4149 [2018-12-03 05:48:25,431 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-03 05:48:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2018-12-03 05:48:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3764. [2018-12-03 05:48:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2018-12-03 05:48:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 9602 transitions. [2018-12-03 05:48:25,469 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 9602 transitions. Word has length 93 [2018-12-03 05:48:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:25,469 INFO L480 AbstractCegarLoop]: Abstraction has 3764 states and 9602 transitions. [2018-12-03 05:48:25,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 9602 transitions. [2018-12-03 05:48:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:25,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:25,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:25,473 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:25,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1650479819, now seen corresponding path program 2 times [2018-12-03 05:48:25,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:25,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:25,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:25,551 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-03 05:48:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:25,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:25,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:25,552 INFO L87 Difference]: Start difference. First operand 3764 states and 9602 transitions. Second operand 7 states. [2018-12-03 05:48:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:25,623 INFO L93 Difference]: Finished difference Result 3855 states and 9744 transitions. [2018-12-03 05:48:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:48:25,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-03 05:48:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:25,627 INFO L225 Difference]: With dead ends: 3855 [2018-12-03 05:48:25,627 INFO L226 Difference]: Without dead ends: 3835 [2018-12-03 05:48:25,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:48:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2018-12-03 05:48:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3710. [2018-12-03 05:48:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2018-12-03 05:48:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 9456 transitions. [2018-12-03 05:48:25,678 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 9456 transitions. Word has length 93 [2018-12-03 05:48:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:25,678 INFO L480 AbstractCegarLoop]: Abstraction has 3710 states and 9456 transitions. [2018-12-03 05:48:25,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 9456 transitions. [2018-12-03 05:48:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:25,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:25,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:25,681 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:25,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash -285180468, now seen corresponding path program 1 times [2018-12-03 05:48:25,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:48:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:25,738 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-03 05:48:25,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:25,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:48:25,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:25,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:48:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:48:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:48:25,739 INFO L87 Difference]: Start difference. First operand 3710 states and 9456 transitions. Second operand 5 states. [2018-12-03 05:48:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:25,848 INFO L93 Difference]: Finished difference Result 4254 states and 10800 transitions. [2018-12-03 05:48:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:48:25,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-03 05:48:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:25,851 INFO L225 Difference]: With dead ends: 4254 [2018-12-03 05:48:25,851 INFO L226 Difference]: Without dead ends: 4222 [2018-12-03 05:48:25,851 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-03 05:48:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2018-12-03 05:48:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3758. [2018-12-03 05:48:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2018-12-03 05:48:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 9560 transitions. [2018-12-03 05:48:25,878 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 9560 transitions. Word has length 93 [2018-12-03 05:48:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:25,878 INFO L480 AbstractCegarLoop]: Abstraction has 3758 states and 9560 transitions. [2018-12-03 05:48:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:48:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 9560 transitions. [2018-12-03 05:48:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:25,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:25,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:25,880 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 959584013, now seen corresponding path program 1 times [2018-12-03 05:48:25,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:25,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:25,954 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-03 05:48:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:48:25,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:25,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:48:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:48:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:48:25,955 INFO L87 Difference]: Start difference. First operand 3758 states and 9560 transitions. Second operand 7 states. [2018-12-03 05:48:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:26,101 INFO L93 Difference]: Finished difference Result 5845 states and 14925 transitions. [2018-12-03 05:48:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:48:26,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-03 05:48:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:26,103 INFO L225 Difference]: With dead ends: 5845 [2018-12-03 05:48:26,103 INFO L226 Difference]: Without dead ends: 2182 [2018-12-03 05:48:26,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:48:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-03 05:48:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2018-12-03 05:48:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-12-03 05:48:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5546 transitions. [2018-12-03 05:48:26,123 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5546 transitions. Word has length 93 [2018-12-03 05:48:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:26,123 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5546 transitions. [2018-12-03 05:48:26,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:48:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5546 transitions. [2018-12-03 05:48:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:26,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:26,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:26,125 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:26,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2018-12-03 05:48:26,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:26,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:26,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:26,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:26,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:26,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-03 05:48:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:26,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 05:48:26,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 05:48:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 05:48:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:48:26,244 INFO L87 Difference]: Start difference. First operand 2182 states and 5546 transitions. Second operand 12 states. [2018-12-03 05:48:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:26,610 INFO L93 Difference]: Finished difference Result 4039 states and 10414 transitions. [2018-12-03 05:48:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 05:48:26,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-03 05:48:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:26,613 INFO L225 Difference]: With dead ends: 4039 [2018-12-03 05:48:26,613 INFO L226 Difference]: Without dead ends: 2903 [2018-12-03 05:48:26,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 05:48:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-12-03 05:48:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2733. [2018-12-03 05:48:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2018-12-03 05:48:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 6802 transitions. [2018-12-03 05:48:26,630 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 6802 transitions. Word has length 93 [2018-12-03 05:48:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:26,630 INFO L480 AbstractCegarLoop]: Abstraction has 2733 states and 6802 transitions. [2018-12-03 05:48:26,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 05:48:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 6802 transitions. [2018-12-03 05:48:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 05:48:26,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:26,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:48:26,632 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:26,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-12-03 05:48:26,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:26,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:48:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:26,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:48:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:48:26,678 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 05:48:26,740 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 05:48:26,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:48:26 BasicIcfg [2018-12-03 05:48:26,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:48:26,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:48:26,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:48:26,742 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:48:26,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:12" (3/4) ... [2018-12-03 05:48:26,743 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 05:48:26,808 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_acb30aac-1755-47e3-be4c-57e5c08527ce/bin-2019/utaipan/witness.graphml [2018-12-03 05:48:26,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:48:26,809 INFO L168 Benchmark]: Toolchain (without parser) took 14849.73 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 953.5 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 423.8 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,810 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:48:26,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.27 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,811 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,811 INFO L168 Benchmark]: RCFGBuilder took 362.21 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: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,811 INFO L168 Benchmark]: TraceAbstraction took 14013.68 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,811 INFO L168 Benchmark]: Witness Printer took 67.05 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:48:26,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.27 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.25 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.21 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: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14013.68 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. * Witness Printer took 67.05 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L753] -1 pthread_t t2483; VAL [__unbuffered_cnt=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] [L754] FCALL, FORK -1 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L755] -1 pthread_t t2484; VAL [__unbuffered_cnt=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] [L756] FCALL, FORK -1 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -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) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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 [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 13.9s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6910 SDtfs, 6518 SDslu, 15219 SDs, 0 SdLazy, 6039 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 83 SyntacticMatches, 18 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, 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: 4.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 101430 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2269 NumberOfCodeBlocks, 2269 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 443734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...