./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/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 4cf32da18d66f68ed7bc089ceb666dd9b7b22154 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 17:15:28,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:15:28,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:15:28,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:15:28,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:15:28,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:15:28,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:15:28,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:15:28,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:15:28,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:15:28,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:15:28,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:15:28,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:15:28,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:15:28,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:15:28,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:15:28,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:15:28,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:15:28,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:15:28,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:15:28,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:15:28,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:15:28,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:15:28,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:15:28,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:15:28,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:15:28,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:15:28,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:15:28,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:15:28,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:15:28,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:15:28,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:15:28,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:15:28,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:15:28,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:15:28,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:15:28,415 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:15:28,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:15:28,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:15:28,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:15:28,423 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:15:28,423 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:15:28,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:15:28,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:15:28,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:15:28,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:15:28,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:15:28,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:15:28,426 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_8d495a61-aa38-4bac-975a-d03200129072/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 -> 4cf32da18d66f68ed7bc089ceb666dd9b7b22154 [2018-12-02 17:15:28,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:15:28,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:15:28,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:15:28,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:15:28,458 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:15:28,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i [2018-12-02 17:15:28,504 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/data/8f708f3b7/fb30a4ea0ea944b69da743b2d680d58c/FLAG85bec4921 [2018-12-02 17:15:28,882 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:15:28,882 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i [2018-12-02 17:15:28,890 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/data/8f708f3b7/fb30a4ea0ea944b69da743b2d680d58c/FLAG85bec4921 [2018-12-02 17:15:28,898 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/data/8f708f3b7/fb30a4ea0ea944b69da743b2d680d58c [2018-12-02 17:15:28,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:15:28,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:15:28,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:15:28,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:15:28,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:15:28,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:15:28" (1/1) ... [2018-12-02 17:15:28,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:28, skipping insertion in model container [2018-12-02 17:15:28,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:15:28" (1/1) ... [2018-12-02 17:15:28,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:15:28,931 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:15:29,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:15:29,116 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:15:29,185 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:15:29,216 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:15:29,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29 WrapperNode [2018-12-02 17:15:29,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:15:29,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:15:29,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:15:29,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:15:29,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:15:29,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:15:29,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:15:29,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:15:29,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... [2018-12-02 17:15:29,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:15:29,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:15:29,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:15:29,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:15:29,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:15:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:15:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:15:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 17:15:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:15:29,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 17:15:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 17:15:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 17:15:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 17:15:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 17:15:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 17:15:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 17:15:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:15:29,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:15:29,315 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 17:15:29,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:15:29,662 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 17:15:29,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:15:29 BoogieIcfgContainer [2018-12-02 17:15:29,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:15:29,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:15:29,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:15:29,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:15:29,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:15:28" (1/3) ... [2018-12-02 17:15:29,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:15:29, skipping insertion in model container [2018-12-02 17:15:29,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:15:29" (2/3) ... [2018-12-02 17:15:29,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:15:29, skipping insertion in model container [2018-12-02 17:15:29,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:15:29" (3/3) ... [2018-12-02 17:15:29,669 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt_false-unreach-call.i [2018-12-02 17:15:29,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,702 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,703 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,704 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,705 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,706 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:15:29,718 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 17:15:29,718 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:15:29,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 17:15:29,737 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 17:15:29,752 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:15:29,752 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:15:29,752 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:15:29,752 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:15:29,752 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:15:29,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:15:29,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:15:29,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:15:29,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-02 17:15:45,176 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-02 17:15:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-02 17:15:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 17:15:45,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:15:45,186 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-02 17:15:45,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:15:45,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:15:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-02 17:15:45,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:15:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:15:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:45,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:15:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:15:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:15:45,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:15:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:15:45,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:15:45,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:15:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:15:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:15:45,365 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-02 17:15:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:15:46,747 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-02 17:15:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:15:46,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-02 17:15:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:15:47,500 INFO L225 Difference]: With dead ends: 233472 [2018-12-02 17:15:47,500 INFO L226 Difference]: Without dead ends: 203722 [2018-12-02 17:15:47,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:15:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-02 17:15:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-02 17:15:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-02 17:15:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-02 17:15:52,646 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-02 17:15:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:15:52,647 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-02 17:15:52,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:15:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-02 17:15:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 17:15:52,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:15:52,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:15:52,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:15:52,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:15:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-02 17:15:52,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:15:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:52,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:15:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:52,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:15:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:15:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:15:52,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:15:52,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:15:52,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:15:52,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:15:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:15:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:15:52,703 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-02 17:15:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:15:53,265 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-02 17:15:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:15:53,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 17:15:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:15:54,027 INFO L225 Difference]: With dead ends: 118892 [2018-12-02 17:15:54,027 INFO L226 Difference]: Without dead ends: 118892 [2018-12-02 17:15:54,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:15:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-02 17:15:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-02 17:15:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-02 17:15:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-02 17:15:56,665 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-02 17:15:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:15:56,666 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-02 17:15:56,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:15:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-02 17:15:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 17:15:56,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:15:56,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:15:56,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:15:56,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:15:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-02 17:15:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:15:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:56,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:15:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:15:56,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:15:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:15:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:15:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:15:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:15:56,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:15:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:15:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:15:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:15:56,732 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-02 17:16:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:00,605 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-02 17:16:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:16:00,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 17:16:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:01,497 INFO L225 Difference]: With dead ends: 325272 [2018-12-02 17:16:01,497 INFO L226 Difference]: Without dead ends: 324272 [2018-12-02 17:16:01,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:16:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-02 17:16:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-02 17:16:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-02 17:16:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-02 17:16:06,749 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-02 17:16:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:06,750 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-02 17:16:06,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:16:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-02 17:16:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 17:16:06,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:06,756 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] [2018-12-02 17:16:06,756 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:16:06,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-02 17:16:06,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:16:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:06,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:16:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:16:06,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:16:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:16:06,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:16:06,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:16:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:16:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:16:06,824 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-02 17:16:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:09,074 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-02 17:16:09,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:16:09,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 17:16:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:10,026 INFO L225 Difference]: With dead ends: 334052 [2018-12-02 17:16:10,026 INFO L226 Difference]: Without dead ends: 333002 [2018-12-02 17:16:10,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:16:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-02 17:16:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-02 17:16:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-02 17:16:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-02 17:16:17,961 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-02 17:16:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:17,961 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-02 17:16:17,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:16:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-02 17:16:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 17:16:17,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:17,986 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] [2018-12-02 17:16:17,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:16:17,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-02 17:16:17,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:16:17,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:17,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:17,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:17,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:16:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:16:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:16:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:16:18,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:16:18,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:16:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:16:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:16:18,034 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-02 17:16:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:20,350 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-02 17:16:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:16:20,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 17:16:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:21,262 INFO L225 Difference]: With dead ends: 342292 [2018-12-02 17:16:21,262 INFO L226 Difference]: Without dead ends: 341292 [2018-12-02 17:16:21,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:16:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-02 17:16:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-02 17:16:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-02 17:16:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-02 17:16:29,384 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-02 17:16:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:29,384 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-02 17:16:29,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:16:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-02 17:16:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 17:16:29,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:29,457 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] [2018-12-02 17:16:29,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:16:29,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-02 17:16:29,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:16:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:29,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:16:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:16:29,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:16:29,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:16:29,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:16:29,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:16:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:16:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:16:29,511 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-02 17:16:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:31,631 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-02 17:16:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:16:31,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 17:16:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:32,485 INFO L225 Difference]: With dead ends: 312432 [2018-12-02 17:16:32,485 INFO L226 Difference]: Without dead ends: 311792 [2018-12-02 17:16:32,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:16:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-02 17:16:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-02 17:16:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-02 17:16:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-02 17:16:41,421 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-02 17:16:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:16:41,421 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-02 17:16:41,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:16:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-02 17:16:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 17:16:41,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:16:41,533 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] [2018-12-02 17:16:41,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:16:41,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:16:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-02 17:16:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:16:41,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:41,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:16:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:16:41,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:16:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:16:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:16:41,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:16:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:16:41,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:16:41,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:16:41,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:16:41,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:16:41,592 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-02 17:16:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:16:45,687 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-02 17:16:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:16:45,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-02 17:16:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:16:52,031 INFO L225 Difference]: With dead ends: 617312 [2018-12-02 17:16:52,031 INFO L226 Difference]: Without dead ends: 615712 [2018-12-02 17:16:52,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:16:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-02 17:16:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-02 17:16:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-02 17:17:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-02 17:17:01,319 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-02 17:17:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:01,320 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-02 17:17:01,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:17:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-02 17:17:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 17:17:01,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:01,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:17:01,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:17:01,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-02 17:17:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:17:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:01,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:17:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:01,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-02 17:17:01,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:17:01,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:17:01,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:17:01,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:17:01,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:17:01,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:17:01,538 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-02 17:17:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:04,242 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-02 17:17:04,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:17:04,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 17:17:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:06,116 INFO L225 Difference]: With dead ends: 438907 [2018-12-02 17:17:06,116 INFO L226 Difference]: Without dead ends: 438907 [2018-12-02 17:17:06,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:17:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-02 17:17:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-02 17:17:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-02 17:17:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-02 17:17:18,325 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-02 17:17:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:18,325 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-02 17:17:18,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:17:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-02 17:17:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 17:17:18,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:18,599 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] [2018-12-02 17:17:18,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:17:18,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-02 17:17:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:17:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:18,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:17:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:17:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:17:18,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:17:18,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:17:18,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:17:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:17:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:17:18,670 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-02 17:17:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:23,441 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-02 17:17:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:17:23,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-02 17:17:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:25,523 INFO L225 Difference]: With dead ends: 675132 [2018-12-02 17:17:25,523 INFO L226 Difference]: Without dead ends: 673532 [2018-12-02 17:17:25,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 17:17:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-02 17:17:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-02 17:17:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-02 17:17:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-02 17:17:40,526 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-02 17:17:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:17:40,526 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-02 17:17:40,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:17:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-02 17:17:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 17:17:40,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:17:40,818 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-02 17:17:40,818 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:17:40,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:17:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-02 17:17:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:17:40,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:40,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:17:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:17:40,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:17:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:17:40,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-02 17:17:40,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:17:40,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:17:40,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:17:40,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:17:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:17:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:17:40,884 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 7 states. [2018-12-02 17:17:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:17:44,958 INFO L93 Difference]: Finished difference Result 515737 states and 2256101 transitions. [2018-12-02 17:17:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:17:44,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-02 17:17:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:17:46,468 INFO L225 Difference]: With dead ends: 515737 [2018-12-02 17:17:46,468 INFO L226 Difference]: Without dead ends: 514387 [2018-12-02 17:17:46,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-02 17:17:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514387 states. [2018-12-02 17:17:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514387 to 389347. [2018-12-02 17:17:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389347 states. [2018-12-02 17:18:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389347 states to 389347 states and 1713924 transitions. [2018-12-02 17:18:00,586 INFO L78 Accepts]: Start accepts. Automaton has 389347 states and 1713924 transitions. Word has length 72 [2018-12-02 17:18:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:18:00,586 INFO L480 AbstractCegarLoop]: Abstraction has 389347 states and 1713924 transitions. [2018-12-02 17:18:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:18:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 389347 states and 1713924 transitions. [2018-12-02 17:18:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 17:18:00,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:18:00,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:18:00,941 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:18:00,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:18:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 146003645, now seen corresponding path program 1 times [2018-12-02 17:18:00,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:18:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:18:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:00,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:18:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:18:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:18:01,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:18:01,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:18:01,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:18:01,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:18:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:18:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:18:01,006 INFO L87 Difference]: Start difference. First operand 389347 states and 1713924 transitions. Second operand 6 states. [2018-12-02 17:18:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:18:04,763 INFO L93 Difference]: Finished difference Result 508422 states and 2226794 transitions. [2018-12-02 17:18:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:18:04,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-02 17:18:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:18:06,228 INFO L225 Difference]: With dead ends: 508422 [2018-12-02 17:18:06,228 INFO L226 Difference]: Without dead ends: 502462 [2018-12-02 17:18:06,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:18:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502462 states. [2018-12-02 17:18:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502462 to 439622. [2018-12-02 17:18:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439622 states. [2018-12-02 17:18:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439622 states to 439622 states and 1937949 transitions. [2018-12-02 17:18:16,465 INFO L78 Accepts]: Start accepts. Automaton has 439622 states and 1937949 transitions. Word has length 74 [2018-12-02 17:18:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:18:16,465 INFO L480 AbstractCegarLoop]: Abstraction has 439622 states and 1937949 transitions. [2018-12-02 17:18:16,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:18:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 439622 states and 1937949 transitions. [2018-12-02 17:18:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 17:18:16,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:18:16,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:18:16,893 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:18:16,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:18:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash -137146819, now seen corresponding path program 1 times [2018-12-02 17:18:16,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:18:16,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:16,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:18:16,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:16,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:18:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:18:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:18:16,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:18:16,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:18:16,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:18:16,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:18:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:18:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:18:16,958 INFO L87 Difference]: Start difference. First operand 439622 states and 1937949 transitions. Second operand 7 states. [2018-12-02 17:18:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:18:24,048 INFO L93 Difference]: Finished difference Result 590157 states and 2550697 transitions. [2018-12-02 17:18:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:18:24,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 17:18:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:18:25,807 INFO L225 Difference]: With dead ends: 590157 [2018-12-02 17:18:25,807 INFO L226 Difference]: Without dead ends: 590157 [2018-12-02 17:18:25,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:18:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590157 states. [2018-12-02 17:18:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590157 to 542807. [2018-12-02 17:18:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542807 states. [2018-12-02 17:18:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542807 states to 542807 states and 2362207 transitions. [2018-12-02 17:18:38,155 INFO L78 Accepts]: Start accepts. Automaton has 542807 states and 2362207 transitions. Word has length 74 [2018-12-02 17:18:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:18:38,155 INFO L480 AbstractCegarLoop]: Abstraction has 542807 states and 2362207 transitions. [2018-12-02 17:18:38,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:18:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 542807 states and 2362207 transitions. [2018-12-02 17:18:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 17:18:38,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:18:38,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:18:38,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:18:38,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:18:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1107617662, now seen corresponding path program 1 times [2018-12-02 17:18:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:18:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:18:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:38,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:18:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:18:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:18:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:18:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:18:38,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:18:38,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:18:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:18:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:18:38,736 INFO L87 Difference]: Start difference. First operand 542807 states and 2362207 transitions. Second operand 4 states. [2018-12-02 17:18:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:18:41,461 INFO L93 Difference]: Finished difference Result 469758 states and 2015930 transitions. [2018-12-02 17:18:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:18:41,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 17:18:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:18:47,842 INFO L225 Difference]: With dead ends: 469758 [2018-12-02 17:18:47,842 INFO L226 Difference]: Without dead ends: 467053 [2018-12-02 17:18:47,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:18:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467053 states. [2018-12-02 17:18:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467053 to 467053. [2018-12-02 17:18:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467053 states. [2018-12-02 17:18:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467053 states to 467053 states and 2006968 transitions. [2018-12-02 17:18:56,749 INFO L78 Accepts]: Start accepts. Automaton has 467053 states and 2006968 transitions. Word has length 74 [2018-12-02 17:18:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:18:56,749 INFO L480 AbstractCegarLoop]: Abstraction has 467053 states and 2006968 transitions. [2018-12-02 17:18:56,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:18:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 467053 states and 2006968 transitions. [2018-12-02 17:18:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 17:18:57,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:18:57,767 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] [2018-12-02 17:18:57,767 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:18:57,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:18:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1793024226, now seen corresponding path program 1 times [2018-12-02 17:18:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:18:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:57,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:18:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:18:57,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:18:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:18:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:18:57,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:18:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:18:57,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:18:57,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:18:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:18:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:18:57,808 INFO L87 Difference]: Start difference. First operand 467053 states and 2006968 transitions. Second operand 5 states. [2018-12-02 17:18:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:18:58,393 INFO L93 Difference]: Finished difference Result 137697 states and 546963 transitions. [2018-12-02 17:18:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:18:58,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 17:18:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:18:58,704 INFO L225 Difference]: With dead ends: 137697 [2018-12-02 17:18:58,704 INFO L226 Difference]: Without dead ends: 135305 [2018-12-02 17:18:58,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:18:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135305 states. [2018-12-02 17:19:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135305 to 135245. [2018-12-02 17:19:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135245 states. [2018-12-02 17:19:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135245 states to 135245 states and 537799 transitions. [2018-12-02 17:19:01,001 INFO L78 Accepts]: Start accepts. Automaton has 135245 states and 537799 transitions. Word has length 75 [2018-12-02 17:19:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:01,001 INFO L480 AbstractCegarLoop]: Abstraction has 135245 states and 537799 transitions. [2018-12-02 17:19:01,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 135245 states and 537799 transitions. [2018-12-02 17:19:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 17:19:01,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:01,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:01,131 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:01,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -405984454, now seen corresponding path program 1 times [2018-12-02 17:19:01,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:01,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:01,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:01,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:01,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:01,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:01,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:19:01,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:01,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:19:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:19:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:19:01,171 INFO L87 Difference]: Start difference. First operand 135245 states and 537799 transitions. Second operand 4 states. [2018-12-02 17:19:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:02,202 INFO L93 Difference]: Finished difference Result 169525 states and 668412 transitions. [2018-12-02 17:19:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:19:02,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-02 17:19:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:02,578 INFO L225 Difference]: With dead ends: 169525 [2018-12-02 17:19:02,579 INFO L226 Difference]: Without dead ends: 169525 [2018-12-02 17:19:02,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169525 states. [2018-12-02 17:19:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169525 to 140469. [2018-12-02 17:19:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140469 states. [2018-12-02 17:19:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140469 states to 140469 states and 557228 transitions. [2018-12-02 17:19:05,044 INFO L78 Accepts]: Start accepts. Automaton has 140469 states and 557228 transitions. Word has length 85 [2018-12-02 17:19:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:05,045 INFO L480 AbstractCegarLoop]: Abstraction has 140469 states and 557228 transitions. [2018-12-02 17:19:05,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:19:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 140469 states and 557228 transitions. [2018-12-02 17:19:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 17:19:05,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:05,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:05,189 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:05,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -660720999, now seen corresponding path program 1 times [2018-12-02 17:19:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:05,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:05,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:05,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:05,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:05,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:05,243 INFO L87 Difference]: Start difference. First operand 140469 states and 557228 transitions. Second operand 6 states. [2018-12-02 17:19:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:05,329 INFO L93 Difference]: Finished difference Result 20597 states and 70892 transitions. [2018-12-02 17:19:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:19:05,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-02 17:19:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:05,355 INFO L225 Difference]: With dead ends: 20597 [2018-12-02 17:19:05,356 INFO L226 Difference]: Without dead ends: 18885 [2018-12-02 17:19:05,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:19:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2018-12-02 17:19:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 18370. [2018-12-02 17:19:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18370 states. [2018-12-02 17:19:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 63196 transitions. [2018-12-02 17:19:05,557 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 63196 transitions. Word has length 85 [2018-12-02 17:19:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:05,558 INFO L480 AbstractCegarLoop]: Abstraction has 18370 states and 63196 transitions. [2018-12-02 17:19:05,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 63196 transitions. [2018-12-02 17:19:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:05,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:05,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:05,573 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:05,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-02 17:19:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:05,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:05,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:05,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:19:05,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:05,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:19:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:19:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:19:05,600 INFO L87 Difference]: Start difference. First operand 18370 states and 63196 transitions. Second operand 3 states. [2018-12-02 17:19:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:05,704 INFO L93 Difference]: Finished difference Result 18790 states and 64462 transitions. [2018-12-02 17:19:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:19:05,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-02 17:19:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:05,728 INFO L225 Difference]: With dead ends: 18790 [2018-12-02 17:19:05,728 INFO L226 Difference]: Without dead ends: 18790 [2018-12-02 17:19:05,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:19:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2018-12-02 17:19:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18560. [2018-12-02 17:19:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2018-12-02 17:19:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 63768 transitions. [2018-12-02 17:19:06,052 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 63768 transitions. Word has length 98 [2018-12-02 17:19:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:06,053 INFO L480 AbstractCegarLoop]: Abstraction has 18560 states and 63768 transitions. [2018-12-02 17:19:06,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:19:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 63768 transitions. [2018-12-02 17:19:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:06,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:06,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:06,069 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:06,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1088162851, now seen corresponding path program 1 times [2018-12-02 17:19:06,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:06,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:06,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:06,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:06,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:06,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:06,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:19:06,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:06,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:19:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:19:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:19:06,102 INFO L87 Difference]: Start difference. First operand 18560 states and 63768 transitions. Second operand 4 states. [2018-12-02 17:19:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:06,266 INFO L93 Difference]: Finished difference Result 25169 states and 86632 transitions. [2018-12-02 17:19:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:19:06,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 17:19:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:06,303 INFO L225 Difference]: With dead ends: 25169 [2018-12-02 17:19:06,303 INFO L226 Difference]: Without dead ends: 25169 [2018-12-02 17:19:06,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:19:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25169 states. [2018-12-02 17:19:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25169 to 18760. [2018-12-02 17:19:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18760 states. [2018-12-02 17:19:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18760 states to 18760 states and 64368 transitions. [2018-12-02 17:19:06,542 INFO L78 Accepts]: Start accepts. Automaton has 18760 states and 64368 transitions. Word has length 98 [2018-12-02 17:19:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:06,542 INFO L480 AbstractCegarLoop]: Abstraction has 18760 states and 64368 transitions. [2018-12-02 17:19:06,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:19:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18760 states and 64368 transitions. [2018-12-02 17:19:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:06,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:06,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:06,560 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:06,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 218366757, now seen corresponding path program 2 times [2018-12-02 17:19:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:06,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:06,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:06,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:06,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:19:06,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:06,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:19:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:19:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:06,603 INFO L87 Difference]: Start difference. First operand 18760 states and 64368 transitions. Second operand 5 states. [2018-12-02 17:19:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:06,782 INFO L93 Difference]: Finished difference Result 22960 states and 77638 transitions. [2018-12-02 17:19:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:19:06,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-02 17:19:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:06,812 INFO L225 Difference]: With dead ends: 22960 [2018-12-02 17:19:06,812 INFO L226 Difference]: Without dead ends: 22960 [2018-12-02 17:19:06,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22960 states. [2018-12-02 17:19:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22960 to 20686. [2018-12-02 17:19:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20686 states. [2018-12-02 17:19:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20686 states to 20686 states and 70572 transitions. [2018-12-02 17:19:07,038 INFO L78 Accepts]: Start accepts. Automaton has 20686 states and 70572 transitions. Word has length 98 [2018-12-02 17:19:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:07,038 INFO L480 AbstractCegarLoop]: Abstraction has 20686 states and 70572 transitions. [2018-12-02 17:19:07,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20686 states and 70572 transitions. [2018-12-02 17:19:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:07,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:07,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:07,055 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:07,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash -806327164, now seen corresponding path program 1 times [2018-12-02 17:19:07,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:07,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:07,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:19:07,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:07,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:07,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:07,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:07,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:07,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:07,101 INFO L87 Difference]: Start difference. First operand 20686 states and 70572 transitions. Second operand 7 states. [2018-12-02 17:19:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:07,360 INFO L93 Difference]: Finished difference Result 23106 states and 78008 transitions. [2018-12-02 17:19:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:19:07,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-02 17:19:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:07,389 INFO L225 Difference]: With dead ends: 23106 [2018-12-02 17:19:07,389 INFO L226 Difference]: Without dead ends: 23041 [2018-12-02 17:19:07,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:19:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23041 states. [2018-12-02 17:19:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23041 to 21986. [2018-12-02 17:19:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21986 states. [2018-12-02 17:19:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21986 states to 21986 states and 74777 transitions. [2018-12-02 17:19:07,628 INFO L78 Accepts]: Start accepts. Automaton has 21986 states and 74777 transitions. Word has length 98 [2018-12-02 17:19:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 21986 states and 74777 transitions. [2018-12-02 17:19:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21986 states and 74777 transitions. [2018-12-02 17:19:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:07,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:07,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:07,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:07,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1646225981, now seen corresponding path program 3 times [2018-12-02 17:19:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:07,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:07,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:07,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:19:07,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:07,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:19:07,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:19:07,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:07,685 INFO L87 Difference]: Start difference. First operand 21986 states and 74777 transitions. Second operand 5 states. [2018-12-02 17:19:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:07,936 INFO L93 Difference]: Finished difference Result 23031 states and 77893 transitions. [2018-12-02 17:19:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:19:07,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-02 17:19:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:07,962 INFO L225 Difference]: With dead ends: 23031 [2018-12-02 17:19:07,962 INFO L226 Difference]: Without dead ends: 23031 [2018-12-02 17:19:07,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23031 states. [2018-12-02 17:19:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23031 to 22106. [2018-12-02 17:19:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22106 states. [2018-12-02 17:19:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22106 states to 22106 states and 75113 transitions. [2018-12-02 17:19:08,177 INFO L78 Accepts]: Start accepts. Automaton has 22106 states and 75113 transitions. Word has length 98 [2018-12-02 17:19:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:08,177 INFO L480 AbstractCegarLoop]: Abstraction has 22106 states and 75113 transitions. [2018-12-02 17:19:08,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22106 states and 75113 transitions. [2018-12-02 17:19:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:19:08,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:08,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:08,194 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:08,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1164612293, now seen corresponding path program 1 times [2018-12-02 17:19:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:08,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:19:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:08,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:08,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-02 17:19:08,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:19:08,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:19:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:19:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:08,240 INFO L87 Difference]: Start difference. First operand 22106 states and 75113 transitions. Second operand 5 states. [2018-12-02 17:19:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:08,436 INFO L93 Difference]: Finished difference Result 26192 states and 87700 transitions. [2018-12-02 17:19:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:19:08,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-02 17:19:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:08,469 INFO L225 Difference]: With dead ends: 26192 [2018-12-02 17:19:08,469 INFO L226 Difference]: Without dead ends: 26052 [2018-12-02 17:19:08,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-02 17:19:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26052 states. [2018-12-02 17:19:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26052 to 22601. [2018-12-02 17:19:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22601 states. [2018-12-02 17:19:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22601 states to 22601 states and 76539 transitions. [2018-12-02 17:19:08,703 INFO L78 Accepts]: Start accepts. Automaton has 22601 states and 76539 transitions. Word has length 98 [2018-12-02 17:19:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 22601 states and 76539 transitions. [2018-12-02 17:19:08,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 22601 states and 76539 transitions. [2018-12-02 17:19:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:08,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:08,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:08,720 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:08,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-02 17:19:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:08,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:08,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:08,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:19:08,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:08,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:19:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:19:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:19:08,760 INFO L87 Difference]: Start difference. First operand 22601 states and 76539 transitions. Second operand 4 states. [2018-12-02 17:19:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:08,947 INFO L93 Difference]: Finished difference Result 37324 states and 127010 transitions. [2018-12-02 17:19:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:19:08,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 17:19:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:09,001 INFO L225 Difference]: With dead ends: 37324 [2018-12-02 17:19:09,001 INFO L226 Difference]: Without dead ends: 37324 [2018-12-02 17:19:09,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:19:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37324 states. [2018-12-02 17:19:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37324 to 20901. [2018-12-02 17:19:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2018-12-02 17:19:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 70774 transitions. [2018-12-02 17:19:09,322 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 70774 transitions. Word has length 100 [2018-12-02 17:19:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:09,322 INFO L480 AbstractCegarLoop]: Abstraction has 20901 states and 70774 transitions. [2018-12-02 17:19:09,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:19:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 70774 transitions. [2018-12-02 17:19:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:09,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:09,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:09,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:09,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2017356457, now seen corresponding path program 1 times [2018-12-02 17:19:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:09,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:09,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:09,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:09,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:09,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:09,403 INFO L87 Difference]: Start difference. First operand 20901 states and 70774 transitions. Second operand 6 states. [2018-12-02 17:19:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:09,618 INFO L93 Difference]: Finished difference Result 22736 states and 76237 transitions. [2018-12-02 17:19:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:19:09,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 17:19:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:09,645 INFO L225 Difference]: With dead ends: 22736 [2018-12-02 17:19:09,645 INFO L226 Difference]: Without dead ends: 22736 [2018-12-02 17:19:09,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22736 states. [2018-12-02 17:19:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22736 to 21246. [2018-12-02 17:19:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21246 states. [2018-12-02 17:19:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21246 states to 21246 states and 71835 transitions. [2018-12-02 17:19:09,929 INFO L78 Accepts]: Start accepts. Automaton has 21246 states and 71835 transitions. Word has length 100 [2018-12-02 17:19:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:09,929 INFO L480 AbstractCegarLoop]: Abstraction has 21246 states and 71835 transitions. [2018-12-02 17:19:09,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21246 states and 71835 transitions. [2018-12-02 17:19:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:09,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:09,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:09,948 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:09,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1047775434, now seen corresponding path program 1 times [2018-12-02 17:19:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:09,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:09,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:09,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:09,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:09,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:09,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:09,997 INFO L87 Difference]: Start difference. First operand 21246 states and 71835 transitions. Second operand 6 states. [2018-12-02 17:19:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:10,182 INFO L93 Difference]: Finished difference Result 20395 states and 68701 transitions. [2018-12-02 17:19:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:19:10,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 17:19:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:10,207 INFO L225 Difference]: With dead ends: 20395 [2018-12-02 17:19:10,207 INFO L226 Difference]: Without dead ends: 20395 [2018-12-02 17:19:10,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:19:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20395 states. [2018-12-02 17:19:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20395 to 20006. [2018-12-02 17:19:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20006 states. [2018-12-02 17:19:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 67563 transitions. [2018-12-02 17:19:10,421 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 67563 transitions. Word has length 100 [2018-12-02 17:19:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:10,421 INFO L480 AbstractCegarLoop]: Abstraction has 20006 states and 67563 transitions. [2018-12-02 17:19:10,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 67563 transitions. [2018-12-02 17:19:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:10,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:10,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:10,439 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:10,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 34388921, now seen corresponding path program 1 times [2018-12-02 17:19:10,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:10,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:10,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:10,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:10,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:10,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:10,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:10,489 INFO L87 Difference]: Start difference. First operand 20006 states and 67563 transitions. Second operand 6 states. [2018-12-02 17:19:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:10,728 INFO L93 Difference]: Finished difference Result 21421 states and 71270 transitions. [2018-12-02 17:19:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:19:10,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 17:19:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:10,754 INFO L225 Difference]: With dead ends: 21421 [2018-12-02 17:19:10,754 INFO L226 Difference]: Without dead ends: 20871 [2018-12-02 17:19:10,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20871 states. [2018-12-02 17:19:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20871 to 20186. [2018-12-02 17:19:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-02 17:19:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 67922 transitions. [2018-12-02 17:19:10,971 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 67922 transitions. Word has length 100 [2018-12-02 17:19:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:10,971 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 67922 transitions. [2018-12-02 17:19:10,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 67922 transitions. [2018-12-02 17:19:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:10,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:10,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:10,989 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:10,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1735129400, now seen corresponding path program 1 times [2018-12-02 17:19:10,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:10,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:10,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:11,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:11,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:11,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:11,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:11,051 INFO L87 Difference]: Start difference. First operand 20186 states and 67922 transitions. Second operand 7 states. [2018-12-02 17:19:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:11,219 INFO L93 Difference]: Finished difference Result 21139 states and 70990 transitions. [2018-12-02 17:19:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:19:11,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-02 17:19:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:11,246 INFO L225 Difference]: With dead ends: 21139 [2018-12-02 17:19:11,246 INFO L226 Difference]: Without dead ends: 21139 [2018-12-02 17:19:11,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21139 states. [2018-12-02 17:19:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21139 to 20091. [2018-12-02 17:19:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2018-12-02 17:19:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 67646 transitions. [2018-12-02 17:19:11,463 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 67646 transitions. Word has length 100 [2018-12-02 17:19:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:11,463 INFO L480 AbstractCegarLoop]: Abstraction has 20091 states and 67646 transitions. [2018-12-02 17:19:11,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 67646 transitions. [2018-12-02 17:19:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:11,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:11,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:11,480 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:11,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1148958376, now seen corresponding path program 1 times [2018-12-02 17:19:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:11,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:11,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:11,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:11,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:19:11,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:11,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:19:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:19:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:11,556 INFO L87 Difference]: Start difference. First operand 20091 states and 67646 transitions. Second operand 5 states. [2018-12-02 17:19:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:11,658 INFO L93 Difference]: Finished difference Result 18687 states and 63075 transitions. [2018-12-02 17:19:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:19:11,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-02 17:19:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:11,681 INFO L225 Difference]: With dead ends: 18687 [2018-12-02 17:19:11,681 INFO L226 Difference]: Without dead ends: 18687 [2018-12-02 17:19:11,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2018-12-02 17:19:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18502. [2018-12-02 17:19:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-12-02 17:19:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 62557 transitions. [2018-12-02 17:19:11,916 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 62557 transitions. Word has length 100 [2018-12-02 17:19:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:11,916 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 62557 transitions. [2018-12-02 17:19:11,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 62557 transitions. [2018-12-02 17:19:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 17:19:11,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:11,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:11,931 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:11,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1210348633, now seen corresponding path program 1 times [2018-12-02 17:19:11,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:11,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:11,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:12,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:12,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:12,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:12,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:12,014 INFO L87 Difference]: Start difference. First operand 18502 states and 62557 transitions. Second operand 6 states. [2018-12-02 17:19:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:12,152 INFO L93 Difference]: Finished difference Result 12422 states and 40685 transitions. [2018-12-02 17:19:12,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:19:12,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 17:19:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:12,167 INFO L225 Difference]: With dead ends: 12422 [2018-12-02 17:19:12,167 INFO L226 Difference]: Without dead ends: 12422 [2018-12-02 17:19:12,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2018-12-02 17:19:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 10933. [2018-12-02 17:19:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2018-12-02 17:19:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 36071 transitions. [2018-12-02 17:19:12,284 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 36071 transitions. Word has length 100 [2018-12-02 17:19:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:12,284 INFO L480 AbstractCegarLoop]: Abstraction has 10933 states and 36071 transitions. [2018-12-02 17:19:12,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 36071 transitions. [2018-12-02 17:19:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:12,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:12,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:12,293 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:12,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-02 17:19:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:12,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:12,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:12,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:12,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:12,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:12,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:12,341 INFO L87 Difference]: Start difference. First operand 10933 states and 36071 transitions. Second operand 7 states. [2018-12-02 17:19:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:12,689 INFO L93 Difference]: Finished difference Result 17605 states and 56946 transitions. [2018-12-02 17:19:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 17:19:12,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 17:19:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:12,712 INFO L225 Difference]: With dead ends: 17605 [2018-12-02 17:19:12,712 INFO L226 Difference]: Without dead ends: 17477 [2018-12-02 17:19:12,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:19:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2018-12-02 17:19:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 13761. [2018-12-02 17:19:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-02 17:19:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45019 transitions. [2018-12-02 17:19:12,876 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45019 transitions. Word has length 102 [2018-12-02 17:19:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:12,876 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45019 transitions. [2018-12-02 17:19:12,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45019 transitions. [2018-12-02 17:19:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:12,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:12,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:12,889 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:12,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-02 17:19:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:12,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:12,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:12,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:12,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:12,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:12,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:12,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:12,954 INFO L87 Difference]: Start difference. First operand 13761 states and 45019 transitions. Second operand 6 states. [2018-12-02 17:19:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:13,075 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-02 17:19:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:19:13,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 17:19:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:13,091 INFO L225 Difference]: With dead ends: 14001 [2018-12-02 17:19:13,091 INFO L226 Difference]: Without dead ends: 14001 [2018-12-02 17:19:13,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:19:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-02 17:19:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-02 17:19:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-02 17:19:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-02 17:19:13,232 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-02 17:19:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:13,233 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-02 17:19:13,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-02 17:19:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:13,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:13,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:13,245 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-02 17:19:13,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:19:13,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:13,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:19:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:19:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:19:13,302 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-02 17:19:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:13,464 INFO L93 Difference]: Finished difference Result 15970 states and 51436 transitions. [2018-12-02 17:19:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:19:13,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-02 17:19:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:13,483 INFO L225 Difference]: With dead ends: 15970 [2018-12-02 17:19:13,484 INFO L226 Difference]: Without dead ends: 15970 [2018-12-02 17:19:13,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:19:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15970 states. [2018-12-02 17:19:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15970 to 13806. [2018-12-02 17:19:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2018-12-02 17:19:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 44760 transitions. [2018-12-02 17:19:13,635 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 44760 transitions. Word has length 102 [2018-12-02 17:19:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:13,635 INFO L480 AbstractCegarLoop]: Abstraction has 13806 states and 44760 transitions. [2018-12-02 17:19:13,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:19:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 44760 transitions. [2018-12-02 17:19:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:13,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:13,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:13,647 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:13,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -668679505, now seen corresponding path program 1 times [2018-12-02 17:19:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:19:13,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:13,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:19:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:19:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:19:13,691 INFO L87 Difference]: Start difference. First operand 13806 states and 44760 transitions. Second operand 5 states. [2018-12-02 17:19:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:13,820 INFO L93 Difference]: Finished difference Result 15598 states and 50520 transitions. [2018-12-02 17:19:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:19:13,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 17:19:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:13,837 INFO L225 Difference]: With dead ends: 15598 [2018-12-02 17:19:13,837 INFO L226 Difference]: Without dead ends: 15470 [2018-12-02 17:19:13,837 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-02 17:19:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2018-12-02 17:19:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 11520. [2018-12-02 17:19:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11520 states. [2018-12-02 17:19:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 37527 transitions. [2018-12-02 17:19:13,973 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 37527 transitions. Word has length 102 [2018-12-02 17:19:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:13,974 INFO L480 AbstractCegarLoop]: Abstraction has 11520 states and 37527 transitions. [2018-12-02 17:19:13,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:19:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 37527 transitions. [2018-12-02 17:19:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:13,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:13,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:13,984 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:13,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 576084976, now seen corresponding path program 1 times [2018-12-02 17:19:13,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:13,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 17:19:14,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:14,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 17:19:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:19:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:19:14,130 INFO L87 Difference]: Start difference. First operand 11520 states and 37527 transitions. Second operand 10 states. [2018-12-02 17:19:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:14,465 INFO L93 Difference]: Finished difference Result 21916 states and 71836 transitions. [2018-12-02 17:19:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:19:14,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-02 17:19:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:14,477 INFO L225 Difference]: With dead ends: 21916 [2018-12-02 17:19:14,478 INFO L226 Difference]: Without dead ends: 10860 [2018-12-02 17:19:14,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 17:19:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2018-12-02 17:19:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10860. [2018-12-02 17:19:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10860 states. [2018-12-02 17:19:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 35591 transitions. [2018-12-02 17:19:14,582 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 35591 transitions. Word has length 102 [2018-12-02 17:19:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:14,583 INFO L480 AbstractCegarLoop]: Abstraction has 10860 states and 35591 transitions. [2018-12-02 17:19:14,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 17:19:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 35591 transitions. [2018-12-02 17:19:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:14,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:14,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:14,591 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:14,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1577961002, now seen corresponding path program 2 times [2018-12-02 17:19:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:14,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:14,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:14,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:14,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:14,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:14,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:14,647 INFO L87 Difference]: Start difference. First operand 10860 states and 35591 transitions. Second operand 7 states. [2018-12-02 17:19:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:14,839 INFO L93 Difference]: Finished difference Result 18110 states and 60250 transitions. [2018-12-02 17:19:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:19:14,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 17:19:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:14,849 INFO L225 Difference]: With dead ends: 18110 [2018-12-02 17:19:14,849 INFO L226 Difference]: Without dead ends: 7461 [2018-12-02 17:19:14,850 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-02 17:19:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-02 17:19:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-02 17:19:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-02 17:19:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25211 transitions. [2018-12-02 17:19:14,930 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25211 transitions. Word has length 102 [2018-12-02 17:19:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:14,930 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25211 transitions. [2018-12-02 17:19:14,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25211 transitions. [2018-12-02 17:19:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:14,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:14,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:14,936 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:14,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-02 17:19:14,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:14,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:19:14,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:14,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:14,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:14,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:14,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:14,996 INFO L87 Difference]: Start difference. First operand 7461 states and 25211 transitions. Second operand 7 states. [2018-12-02 17:19:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:15,212 INFO L93 Difference]: Finished difference Result 9597 states and 31665 transitions. [2018-12-02 17:19:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:19:15,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 17:19:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:15,224 INFO L225 Difference]: With dead ends: 9597 [2018-12-02 17:19:15,224 INFO L226 Difference]: Without dead ends: 9461 [2018-12-02 17:19:15,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:19:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2018-12-02 17:19:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 7445. [2018-12-02 17:19:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2018-12-02 17:19:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 25119 transitions. [2018-12-02 17:19:15,304 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 25119 transitions. Word has length 102 [2018-12-02 17:19:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:15,304 INFO L480 AbstractCegarLoop]: Abstraction has 7445 states and 25119 transitions. [2018-12-02 17:19:15,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 25119 transitions. [2018-12-02 17:19:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:15,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:15,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:15,311 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:15,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-02 17:19:15,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:15,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:15,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-02 17:19:15,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:19:15,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:15,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:19:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:19:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:19:15,367 INFO L87 Difference]: Start difference. First operand 7445 states and 25119 transitions. Second operand 7 states. [2018-12-02 17:19:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:15,525 INFO L93 Difference]: Finished difference Result 14873 states and 50598 transitions. [2018-12-02 17:19:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:19:15,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 17:19:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:15,544 INFO L225 Difference]: With dead ends: 14873 [2018-12-02 17:19:15,544 INFO L226 Difference]: Without dead ends: 14873 [2018-12-02 17:19:15,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:19:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14873 states. [2018-12-02 17:19:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14873 to 7605. [2018-12-02 17:19:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7605 states. [2018-12-02 17:19:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7605 states to 7605 states and 25535 transitions. [2018-12-02 17:19:15,651 INFO L78 Accepts]: Start accepts. Automaton has 7605 states and 25535 transitions. Word has length 102 [2018-12-02 17:19:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:15,651 INFO L480 AbstractCegarLoop]: Abstraction has 7605 states and 25535 transitions. [2018-12-02 17:19:15,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:19:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7605 states and 25535 transitions. [2018-12-02 17:19:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:15,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:15,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:15,658 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:15,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-02 17:19:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:19:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:15,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:19:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:19:15,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:19:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 17:19:15,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:19:15,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 17:19:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:19:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:19:15,756 INFO L87 Difference]: Start difference. First operand 7605 states and 25535 transitions. Second operand 12 states. [2018-12-02 17:19:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:19:16,077 INFO L93 Difference]: Finished difference Result 14809 states and 49866 transitions. [2018-12-02 17:19:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:19:16,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-02 17:19:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:19:16,089 INFO L225 Difference]: With dead ends: 14809 [2018-12-02 17:19:16,089 INFO L226 Difference]: Without dead ends: 10265 [2018-12-02 17:19:16,089 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-02 17:19:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2018-12-02 17:19:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 9657. [2018-12-02 17:19:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9657 states. [2018-12-02 17:19:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 31706 transitions. [2018-12-02 17:19:16,187 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 31706 transitions. Word has length 102 [2018-12-02 17:19:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:19:16,187 INFO L480 AbstractCegarLoop]: Abstraction has 9657 states and 31706 transitions. [2018-12-02 17:19:16,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 17:19:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 31706 transitions. [2018-12-02 17:19:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:19:16,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:19:16,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:19:16,195 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:19:16,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:19:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-02 17:19:16,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:19:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:16,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:19:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:19:16,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:19:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:19:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:19:16,232 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 17:19:16,302 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 17:19:16,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:19:16 BasicIcfg [2018-12-02 17:19:16,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:19:16,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:19:16,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:19:16,303 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:19:16,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:15:29" (3/4) ... [2018-12-02 17:19:16,305 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 17:19:16,373 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8d495a61-aa38-4bac-975a-d03200129072/bin-2019/utaipan/witness.graphml [2018-12-02 17:19:16,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:19:16,374 INFO L168 Benchmark]: Toolchain (without parser) took 227473.58 ms. Allocated memory was 1.0 GB in the beginning and 11.3 GB in the end (delta: 10.3 GB). Free memory was 948.1 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.2 GB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: RCFGBuilder took 391.30 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,375 INFO L168 Benchmark]: TraceAbstraction took 226639.48 ms. Allocated memory was 1.2 GB in the beginning and 11.3 GB in the end (delta: 10.2 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.1 GB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,376 INFO L168 Benchmark]: Witness Printer took 70.22 ms. Allocated memory is still 11.3 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:19:16,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.30 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 226639.48 ms. Allocated memory was 1.2 GB in the beginning and 11.3 GB in the end (delta: 10.2 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.1 GB. Max. memory is 11.5 GB. * Witness Printer took 70.22 ms. Allocated memory is still 11.3 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1506; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1507; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1508; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L725] EXPR 2 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 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 [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] EXPR 2 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 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 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L798] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L798] -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) [L799] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L799] -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)) [L800] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L800] -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)) [L801] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L801] -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)) [L802] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L802] -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)) [L803] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L803] -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)) [L804] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L804] -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)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 226.5s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 75.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9654 SDtfs, 10512 SDslu, 23152 SDs, 0 SdLazy, 8794 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 114 SyntacticMatches, 20 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542807occurred in iteration=12, 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: 129.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 1460236 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3367 NumberOfCodeBlocks, 3367 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3227 ConstructedInterpolants, 0 QuantifiedInterpolants, 661779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...