./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.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_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/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 691fab8578b36371b4449c4d855bdbbbbb6262cc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 07:07:17,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:07:17,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:07:17,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:07:17,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:07:17,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:07:17,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:07:17,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:07:17,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:07:17,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:07:17,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:07:17,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:07:17,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:07:17,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:07:17,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:07:17,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:07:17,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:07:17,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:07:17,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:07:17,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:07:17,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:07:17,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:07:17,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:07:17,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:07:17,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:07:17,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:07:17,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:07:17,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:07:17,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:07:17,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:07:17,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:07:17,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:07:17,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:07:17,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:07:17,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:07:17,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:07:17,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 07:07:17,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:07:17,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:07:17,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:07:17,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:07:17,109 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:07:17,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:07:17,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:07:17,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:07:17,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:07:17,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 07:07:17,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 07:07:17,112 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_e78b7f96-0eab-42b0-b885-af5bbd35a34d/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 -> 691fab8578b36371b4449c4d855bdbbbbb6262cc [2018-12-09 07:07:17,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:07:17,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:07:17,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:07:17,143 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:07:17,143 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:07:17,143 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-09 07:07:17,179 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/data/10e571108/89ee3dc5d75a44b2bf17846e9fdc16f0/FLAG2ccfec385 [2018-12-09 07:07:17,606 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:07:17,607 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-09 07:07:17,613 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/data/10e571108/89ee3dc5d75a44b2bf17846e9fdc16f0/FLAG2ccfec385 [2018-12-09 07:07:17,622 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/data/10e571108/89ee3dc5d75a44b2bf17846e9fdc16f0 [2018-12-09 07:07:17,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:07:17,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:07:17,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:07:17,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:07:17,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:07:17,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:17,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17, skipping insertion in model container [2018-12-09 07:07:17,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:17,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:07:17,654 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:07:17,838 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:07:17,846 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:07:17,923 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:07:17,956 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:07:17,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17 WrapperNode [2018-12-09 07:07:17,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:07:17,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:07:17,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:07:17,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:07:17,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:17,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:17,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:07:17,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:07:17,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:07:17,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:07:18,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... [2018-12-09 07:07:18,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:07:18,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:07:18,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:07:18,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:07:18,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/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-09 07:07:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:07:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:07:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 07:07:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 07:07:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 07:07:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 07:07:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 07:07:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 07:07:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 07:07:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 07:07:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 07:07:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:07:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:07:18,047 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 07:07:18,359 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:07:18,359 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 07:07:18,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:07:18 BoogieIcfgContainer [2018-12-09 07:07:18,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:07:18,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 07:07:18,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 07:07:18,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 07:07:18,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:07:17" (1/3) ... [2018-12-09 07:07:18,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:07:18, skipping insertion in model container [2018-12-09 07:07:18,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:07:17" (2/3) ... [2018-12-09 07:07:18,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:07:18, skipping insertion in model container [2018-12-09 07:07:18,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:07:18" (3/3) ... [2018-12-09 07:07:18,363 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_false-unreach-call.i [2018-12-09 07:07:18,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,384 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:07:18,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 07:07:18,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 07:07:18,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 07:07:18,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 07:07:18,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 07:07:18,433 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 07:07:18,433 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 07:07:18,433 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:07:18,433 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:07:18,433 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 07:07:18,433 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:07:18,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 07:07:18,441 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-09 07:07:33,493 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-09 07:07:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-09 07:07:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 07:07:33,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:07:33,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:07:33,503 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:07:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:07:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-09 07:07:33,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:07:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:07:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:33,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:07:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:07:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:07:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:07:33,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:07:33,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:07:33,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:07:33,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:07:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:07:33,681 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-09 07:07:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:07:35,055 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-09 07:07:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:07:35,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 07:07:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:07:35,767 INFO L225 Difference]: With dead ends: 233471 [2018-12-09 07:07:35,767 INFO L226 Difference]: Without dead ends: 203721 [2018-12-09 07:07:35,768 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-09 07:07:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-09 07:07:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-09 07:07:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 07:07:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-09 07:07:41,049 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-09 07:07:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:07:41,050 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-09 07:07:41,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:07:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-09 07:07:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 07:07:41,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:07:41,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:07:41,057 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:07:41,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:07:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-09 07:07:41,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:07:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:41,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:07:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:41,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:07:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:07:41,098 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-09 07:07:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:07:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:07:41,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:07:41,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:07:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:07:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:07:41,099 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-09 07:07:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:07:41,686 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-09 07:07:41,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:07:41,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 07:07:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:07:42,031 INFO L225 Difference]: With dead ends: 118891 [2018-12-09 07:07:42,031 INFO L226 Difference]: Without dead ends: 118891 [2018-12-09 07:07:42,032 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-09 07:07:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-09 07:07:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-09 07:07:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 07:07:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-09 07:07:44,591 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-09 07:07:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:07:44,592 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-09 07:07:44,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:07:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-09 07:07:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 07:07:44,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:07:44,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:07:44,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:07:44,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:07:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-09 07:07:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:07:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:07:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:44,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:07:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:07:44,654 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-09 07:07:44,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:07:44,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:07:44,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:07:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:07:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:07:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:07:44,655 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-09 07:07:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:07:47,394 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-09 07:07:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:07:47,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-09 07:07:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:07:48,568 INFO L225 Difference]: With dead ends: 325271 [2018-12-09 07:07:48,569 INFO L226 Difference]: Without dead ends: 324271 [2018-12-09 07:07:48,569 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-09 07:07:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-09 07:07:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-09 07:07:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-09 07:07:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-09 07:07:53,217 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-09 07:07:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:07:53,217 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-09 07:07:53,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:07:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-09 07:07:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 07:07:53,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:07:53,222 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-09 07:07:53,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:07:53,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:07:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-09 07:07:53,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:07:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:07:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:53,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:07:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:07:53,262 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-09 07:07:53,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:07:53,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:07:53,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:07:53,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:07:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:07:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:07:53,263 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-09 07:07:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:07:54,348 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-09 07:07:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:07:54,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 07:07:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:07:54,728 INFO L225 Difference]: With dead ends: 163597 [2018-12-09 07:07:54,728 INFO L226 Difference]: Without dead ends: 160992 [2018-12-09 07:07:54,728 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-09 07:07:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-09 07:07:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-09 07:07:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-09 07:07:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-09 07:07:59,873 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-09 07:07:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:07:59,873 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-09 07:07:59,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:07:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-09 07:07:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 07:07:59,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:07:59,879 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-09 07:07:59,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:07:59,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:07:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-09 07:07:59,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:07:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:59,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:07:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:07:59,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:07:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:07:59,925 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-09 07:07:59,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:07:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:07:59,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:07:59,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:07:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:07:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:07:59,925 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-09 07:08:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:01,677 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-09 07:08:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:01,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 07:08:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:02,430 INFO L225 Difference]: With dead ends: 289848 [2018-12-09 07:08:02,431 INFO L226 Difference]: Without dead ends: 289008 [2018-12-09 07:08:02,431 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-09 07:08:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-09 07:08:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-09 07:08:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-09 07:08:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-09 07:08:09,613 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-09 07:08:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:09,614 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-09 07:08:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-09 07:08:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 07:08:09,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:09,633 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-09 07:08:09,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:09,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-09 07:08:09,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:09,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:09,680 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-09 07:08:09,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:09,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:09,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:09,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:09,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:09,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:09,680 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-09 07:08:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:11,532 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-09 07:08:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 07:08:11,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 07:08:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:12,260 INFO L225 Difference]: With dead ends: 292568 [2018-12-09 07:08:12,260 INFO L226 Difference]: Without dead ends: 291728 [2018-12-09 07:08:12,260 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-09 07:08:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-09 07:08:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-09 07:08:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-09 07:08:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-09 07:08:16,762 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-09 07:08:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:16,762 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-09 07:08:16,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-09 07:08:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 07:08:16,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:16,817 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-09 07:08:16,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:16,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-09 07:08:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:16,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:16,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:16,875 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-09 07:08:16,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:16,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:08:16,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:16,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:08:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:08:16,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:08:16,876 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-09 07:08:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:18,603 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-09 07:08:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:18,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 07:08:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:19,266 INFO L225 Difference]: With dead ends: 264420 [2018-12-09 07:08:19,266 INFO L226 Difference]: Without dead ends: 263060 [2018-12-09 07:08:19,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-09 07:08:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-09 07:08:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-09 07:08:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-09 07:08:26,148 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-09 07:08:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:26,148 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-09 07:08:26,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:08:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-09 07:08:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 07:08:26,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:26,563 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-09 07:08:26,564 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:26,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:26,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-09 07:08:26,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:26,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:26,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:26,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:26,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:26,600 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-09 07:08:26,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:26,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:26,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:26,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:26,602 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-09 07:08:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:26,928 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-09 07:08:26,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:08:26,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 07:08:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:27,079 INFO L225 Difference]: With dead ends: 78044 [2018-12-09 07:08:27,079 INFO L226 Difference]: Without dead ends: 75732 [2018-12-09 07:08:27,080 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-09 07:08:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-09 07:08:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-09 07:08:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-09 07:08:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-09 07:08:28,149 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-09 07:08:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:28,149 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-09 07:08:28,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-09 07:08:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 07:08:28,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:28,198 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] [2018-12-09 07:08:28,198 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:28,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-09 07:08:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:28,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:28,638 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-09 07:08:28,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:28,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:08:28,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:28,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:08:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:08:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:08:28,639 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-09 07:08:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:29,103 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-09 07:08:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:29,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 07:08:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:29,328 INFO L225 Difference]: With dead ends: 105528 [2018-12-09 07:08:29,328 INFO L226 Difference]: Without dead ends: 105528 [2018-12-09 07:08:29,328 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-09 07:08:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-09 07:08:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-09 07:08:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-09 07:08:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-09 07:08:30,904 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-09 07:08:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:30,904 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-09 07:08:30,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:08:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-09 07:08:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 07:08:30,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:30,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:30,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:30,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-09 07:08:30,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:30,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:30,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:30,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:30,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:30,997 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-09 07:08:30,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:30,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:08:30,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:08:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:08:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:08:30,998 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-09 07:08:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:31,754 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-09 07:08:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:31,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 07:08:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:31,987 INFO L225 Difference]: With dead ends: 113667 [2018-12-09 07:08:31,988 INFO L226 Difference]: Without dead ends: 113667 [2018-12-09 07:08:31,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-09 07:08:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-09 07:08:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-09 07:08:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-09 07:08:33,699 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-09 07:08:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:33,699 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-09 07:08:33,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:08:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-09 07:08:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 07:08:33,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:33,773 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] [2018-12-09 07:08:33,773 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:33,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-09 07:08:33,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:33,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:33,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:33,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-09 07:08:33,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:33,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:33,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:33,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:33,824 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 6 states. [2018-12-09 07:08:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:33,890 INFO L93 Difference]: Finished difference Result 16164 states and 54990 transitions. [2018-12-09 07:08:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:33,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 07:08:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:33,907 INFO L225 Difference]: With dead ends: 16164 [2018-12-09 07:08:33,907 INFO L226 Difference]: Without dead ends: 14072 [2018-12-09 07:08:33,908 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-09 07:08:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2018-12-09 07:08:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 13537. [2018-12-09 07:08:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-09 07:08:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 46015 transitions. [2018-12-09 07:08:34,048 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 46015 transitions. Word has length 78 [2018-12-09 07:08:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:34,048 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 46015 transitions. [2018-12-09 07:08:34,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 46015 transitions. [2018-12-09 07:08:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:34,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:34,061 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] [2018-12-09 07:08:34,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:34,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1270884801, now seen corresponding path program 1 times [2018-12-09 07:08:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:34,113 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-09 07:08:34,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:34,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:34,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:34,114 INFO L87 Difference]: Start difference. First operand 13537 states and 46015 transitions. Second operand 5 states. [2018-12-09 07:08:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:34,262 INFO L93 Difference]: Finished difference Result 15422 states and 51828 transitions. [2018-12-09 07:08:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:34,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 07:08:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:34,280 INFO L225 Difference]: With dead ends: 15422 [2018-12-09 07:08:34,280 INFO L226 Difference]: Without dead ends: 15422 [2018-12-09 07:08:34,280 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-09 07:08:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15422 states. [2018-12-09 07:08:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15422 to 13947. [2018-12-09 07:08:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13947 states. [2018-12-09 07:08:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13947 states to 13947 states and 47378 transitions. [2018-12-09 07:08:34,424 INFO L78 Accepts]: Start accepts. Automaton has 13947 states and 47378 transitions. Word has length 97 [2018-12-09 07:08:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:34,425 INFO L480 AbstractCegarLoop]: Abstraction has 13947 states and 47378 transitions. [2018-12-09 07:08:34,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13947 states and 47378 transitions. [2018-12-09 07:08:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:34,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:34,437 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] [2018-12-09 07:08:34,437 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:34,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash 87537504, now seen corresponding path program 1 times [2018-12-09 07:08:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:34,482 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-09 07:08:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:34,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:34,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:34,484 INFO L87 Difference]: Start difference. First operand 13947 states and 47378 transitions. Second operand 6 states. [2018-12-09 07:08:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:34,745 INFO L93 Difference]: Finished difference Result 16687 states and 55800 transitions. [2018-12-09 07:08:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:34,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 07:08:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:34,765 INFO L225 Difference]: With dead ends: 16687 [2018-12-09 07:08:34,765 INFO L226 Difference]: Without dead ends: 16357 [2018-12-09 07:08:34,765 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-09 07:08:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16357 states. [2018-12-09 07:08:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16357 to 15837. [2018-12-09 07:08:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15837 states. [2018-12-09 07:08:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 53450 transitions. [2018-12-09 07:08:34,921 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 53450 transitions. Word has length 97 [2018-12-09 07:08:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:34,922 INFO L480 AbstractCegarLoop]: Abstraction has 15837 states and 53450 transitions. [2018-12-09 07:08:34,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 53450 transitions. [2018-12-09 07:08:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:34,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:34,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] [2018-12-09 07:08:34,936 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:34,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1232273469, now seen corresponding path program 2 times [2018-12-09 07:08:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:34,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:34,978 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-09 07:08:34,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:34,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:34,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:34,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:34,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:34,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:34,979 INFO L87 Difference]: Start difference. First operand 15837 states and 53450 transitions. Second operand 5 states. [2018-12-09 07:08:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:35,176 INFO L93 Difference]: Finished difference Result 20664 states and 68496 transitions. [2018-12-09 07:08:35,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:35,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 07:08:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:35,199 INFO L225 Difference]: With dead ends: 20664 [2018-12-09 07:08:35,199 INFO L226 Difference]: Without dead ends: 20504 [2018-12-09 07:08:35,200 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-09 07:08:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2018-12-09 07:08:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 17570. [2018-12-09 07:08:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17570 states. [2018-12-09 07:08:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17570 states to 17570 states and 58965 transitions. [2018-12-09 07:08:35,400 INFO L78 Accepts]: Start accepts. Automaton has 17570 states and 58965 transitions. Word has length 97 [2018-12-09 07:08:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:35,400 INFO L480 AbstractCegarLoop]: Abstraction has 17570 states and 58965 transitions. [2018-12-09 07:08:35,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17570 states and 58965 transitions. [2018-12-09 07:08:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:35,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:35,416 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] [2018-12-09 07:08:35,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:35,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1908320027, now seen corresponding path program 3 times [2018-12-09 07:08:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:35,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:35,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:08:35,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:35,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:35,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:35,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:35,472 INFO L87 Difference]: Start difference. First operand 17570 states and 58965 transitions. Second operand 7 states. [2018-12-09 07:08:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:35,752 INFO L93 Difference]: Finished difference Result 21535 states and 71009 transitions. [2018-12-09 07:08:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:08:35,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-09 07:08:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:35,775 INFO L225 Difference]: With dead ends: 21535 [2018-12-09 07:08:35,775 INFO L226 Difference]: Without dead ends: 21210 [2018-12-09 07:08:35,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:08:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2018-12-09 07:08:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 17585. [2018-12-09 07:08:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17585 states. [2018-12-09 07:08:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17585 states to 17585 states and 58942 transitions. [2018-12-09 07:08:35,969 INFO L78 Accepts]: Start accepts. Automaton has 17585 states and 58942 transitions. Word has length 97 [2018-12-09 07:08:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:35,970 INFO L480 AbstractCegarLoop]: Abstraction has 17585 states and 58942 transitions. [2018-12-09 07:08:35,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 17585 states and 58942 transitions. [2018-12-09 07:08:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:35,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:08:35,986 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:35,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1057118527, now seen corresponding path program 1 times [2018-12-09 07:08:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:35,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:35,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:36,051 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-09 07:08:36,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:36,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:36,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:36,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:36,052 INFO L87 Difference]: Start difference. First operand 17585 states and 58942 transitions. Second operand 6 states. [2018-12-09 07:08:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:36,185 INFO L93 Difference]: Finished difference Result 20760 states and 67307 transitions. [2018-12-09 07:08:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:08:36,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 07:08:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:36,208 INFO L225 Difference]: With dead ends: 20760 [2018-12-09 07:08:36,208 INFO L226 Difference]: Without dead ends: 20685 [2018-12-09 07:08:36,208 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-09 07:08:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20685 states. [2018-12-09 07:08:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20685 to 18285. [2018-12-09 07:08:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2018-12-09 07:08:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 60187 transitions. [2018-12-09 07:08:36,398 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 60187 transitions. Word has length 97 [2018-12-09 07:08:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:36,398 INFO L480 AbstractCegarLoop]: Abstraction has 18285 states and 60187 transitions. [2018-12-09 07:08:36,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 60187 transitions. [2018-12-09 07:08:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:08:36,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:36,415 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] [2018-12-09 07:08:36,415 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:36,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash 32424606, now seen corresponding path program 1 times [2018-12-09 07:08:36,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:36,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:36,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:36,455 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-09 07:08:36,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:36,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:36,456 INFO L87 Difference]: Start difference. First operand 18285 states and 60187 transitions. Second operand 5 states. [2018-12-09 07:08:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:36,621 INFO L93 Difference]: Finished difference Result 24187 states and 77863 transitions. [2018-12-09 07:08:36,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:36,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 07:08:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:36,646 INFO L225 Difference]: With dead ends: 24187 [2018-12-09 07:08:36,646 INFO L226 Difference]: Without dead ends: 23652 [2018-12-09 07:08:36,646 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-09 07:08:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2018-12-09 07:08:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 18930. [2018-12-09 07:08:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18930 states. [2018-12-09 07:08:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 61813 transitions. [2018-12-09 07:08:36,886 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 61813 transitions. Word has length 97 [2018-12-09 07:08:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:36,886 INFO L480 AbstractCegarLoop]: Abstraction has 18930 states and 61813 transitions. [2018-12-09 07:08:36,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 61813 transitions. [2018-12-09 07:08:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:36,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:36,902 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] [2018-12-09 07:08:36,902 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:36,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1707260212, now seen corresponding path program 1 times [2018-12-09 07:08:36,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:36,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:36,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:36,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:36,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:36,975 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-09 07:08:36,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:36,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 07:08:36,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:36,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 07:08:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 07:08:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:08:36,976 INFO L87 Difference]: Start difference. First operand 18930 states and 61813 transitions. Second operand 9 states. [2018-12-09 07:08:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:37,568 INFO L93 Difference]: Finished difference Result 32666 states and 104934 transitions. [2018-12-09 07:08:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 07:08:37,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-09 07:08:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:37,606 INFO L225 Difference]: With dead ends: 32666 [2018-12-09 07:08:37,606 INFO L226 Difference]: Without dead ends: 32538 [2018-12-09 07:08:37,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-09 07:08:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32538 states. [2018-12-09 07:08:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32538 to 24258. [2018-12-09 07:08:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24258 states. [2018-12-09 07:08:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24258 states to 24258 states and 78782 transitions. [2018-12-09 07:08:37,907 INFO L78 Accepts]: Start accepts. Automaton has 24258 states and 78782 transitions. Word has length 99 [2018-12-09 07:08:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:37,908 INFO L480 AbstractCegarLoop]: Abstraction has 24258 states and 78782 transitions. [2018-12-09 07:08:37,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 07:08:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24258 states and 78782 transitions. [2018-12-09 07:08:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:37,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:37,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] [2018-12-09 07:08:37,931 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:37,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -462495731, now seen corresponding path program 1 times [2018-12-09 07:08:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:37,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:37,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:37,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:37,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:37,998 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-09 07:08:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:37,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:37,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:37,998 INFO L87 Difference]: Start difference. First operand 24258 states and 78782 transitions. Second operand 7 states. [2018-12-09 07:08:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:38,412 INFO L93 Difference]: Finished difference Result 38026 states and 122512 transitions. [2018-12-09 07:08:38,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:08:38,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 07:08:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:38,454 INFO L225 Difference]: With dead ends: 38026 [2018-12-09 07:08:38,454 INFO L226 Difference]: Without dead ends: 36926 [2018-12-09 07:08:38,454 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-09 07:08:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36926 states. [2018-12-09 07:08:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36926 to 23748. [2018-12-09 07:08:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2018-12-09 07:08:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 76819 transitions. [2018-12-09 07:08:38,760 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 76819 transitions. Word has length 99 [2018-12-09 07:08:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:38,760 INFO L480 AbstractCegarLoop]: Abstraction has 23748 states and 76819 transitions. [2018-12-09 07:08:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 76819 transitions. [2018-12-09 07:08:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:38,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:38,781 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] [2018-12-09 07:08:38,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:38,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1632816658, now seen corresponding path program 1 times [2018-12-09 07:08:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:38,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:38,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:38,854 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-09 07:08:38,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:38,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:38,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:38,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:38,854 INFO L87 Difference]: Start difference. First operand 23748 states and 76819 transitions. Second operand 6 states. [2018-12-09 07:08:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:38,968 INFO L93 Difference]: Finished difference Result 17635 states and 57458 transitions. [2018-12-09 07:08:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:38,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 07:08:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:38,988 INFO L225 Difference]: With dead ends: 17635 [2018-12-09 07:08:38,988 INFO L226 Difference]: Without dead ends: 17635 [2018-12-09 07:08:38,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:08:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-09 07:08:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 16060. [2018-12-09 07:08:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16060 states. [2018-12-09 07:08:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16060 states to 16060 states and 52773 transitions. [2018-12-09 07:08:39,161 INFO L78 Accepts]: Start accepts. Automaton has 16060 states and 52773 transitions. Word has length 99 [2018-12-09 07:08:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:39,161 INFO L480 AbstractCegarLoop]: Abstraction has 16060 states and 52773 transitions. [2018-12-09 07:08:39,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16060 states and 52773 transitions. [2018-12-09 07:08:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:39,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:39,176 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] [2018-12-09 07:08:39,176 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:39,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-12-09 07:08:39,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:39,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:39,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:39,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:39,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:39,244 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-09 07:08:39,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:39,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:39,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:39,245 INFO L87 Difference]: Start difference. First operand 16060 states and 52773 transitions. Second operand 7 states. [2018-12-09 07:08:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:39,463 INFO L93 Difference]: Finished difference Result 17589 states and 57474 transitions. [2018-12-09 07:08:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:39,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 07:08:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:39,480 INFO L225 Difference]: With dead ends: 17589 [2018-12-09 07:08:39,480 INFO L226 Difference]: Without dead ends: 17589 [2018-12-09 07:08:39,481 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-09 07:08:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2018-12-09 07:08:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 15970. [2018-12-09 07:08:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15970 states. [2018-12-09 07:08:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15970 states to 15970 states and 52521 transitions. [2018-12-09 07:08:39,633 INFO L78 Accepts]: Start accepts. Automaton has 15970 states and 52521 transitions. Word has length 99 [2018-12-09 07:08:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:39,633 INFO L480 AbstractCegarLoop]: Abstraction has 15970 states and 52521 transitions. [2018-12-09 07:08:39,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15970 states and 52521 transitions. [2018-12-09 07:08:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:39,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:39,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] [2018-12-09 07:08:39,648 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:39,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash 954456849, now seen corresponding path program 1 times [2018-12-09 07:08:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:39,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:39,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-09 07:08:39,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:39,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 07:08:39,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:39,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 07:08:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 07:08:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:08:39,736 INFO L87 Difference]: Start difference. First operand 15970 states and 52521 transitions. Second operand 8 states. [2018-12-09 07:08:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:40,029 INFO L93 Difference]: Finished difference Result 20725 states and 67497 transitions. [2018-12-09 07:08:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 07:08:40,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-09 07:08:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:40,053 INFO L225 Difference]: With dead ends: 20725 [2018-12-09 07:08:40,054 INFO L226 Difference]: Without dead ends: 20597 [2018-12-09 07:08:40,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-09 07:08:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20597 states. [2018-12-09 07:08:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20597 to 16691. [2018-12-09 07:08:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16691 states. [2018-12-09 07:08:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16691 states to 16691 states and 54567 transitions. [2018-12-09 07:08:40,242 INFO L78 Accepts]: Start accepts. Automaton has 16691 states and 54567 transitions. Word has length 99 [2018-12-09 07:08:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:40,242 INFO L480 AbstractCegarLoop]: Abstraction has 16691 states and 54567 transitions. [2018-12-09 07:08:40,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 07:08:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16691 states and 54567 transitions. [2018-12-09 07:08:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:40,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:40,256 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] [2018-12-09 07:08:40,256 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:40,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1916070866, now seen corresponding path program 1 times [2018-12-09 07:08:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:40,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:40,317 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-09 07:08:40,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:40,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:40,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:40,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:40,318 INFO L87 Difference]: Start difference. First operand 16691 states and 54567 transitions. Second operand 7 states. [2018-12-09 07:08:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:40,587 INFO L93 Difference]: Finished difference Result 22271 states and 71965 transitions. [2018-12-09 07:08:40,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:40,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 07:08:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:40,612 INFO L225 Difference]: With dead ends: 22271 [2018-12-09 07:08:40,612 INFO L226 Difference]: Without dead ends: 22271 [2018-12-09 07:08:40,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:08:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22271 states. [2018-12-09 07:08:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22271 to 18226. [2018-12-09 07:08:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18226 states. [2018-12-09 07:08:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18226 states to 18226 states and 59616 transitions. [2018-12-09 07:08:40,807 INFO L78 Accepts]: Start accepts. Automaton has 18226 states and 59616 transitions. Word has length 99 [2018-12-09 07:08:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:40,807 INFO L480 AbstractCegarLoop]: Abstraction has 18226 states and 59616 transitions. [2018-12-09 07:08:40,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18226 states and 59616 transitions. [2018-12-09 07:08:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:40,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:40,823 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] [2018-12-09 07:08:40,823 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:40,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1134131949, now seen corresponding path program 1 times [2018-12-09 07:08:40,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:40,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:40,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:40,869 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-09 07:08:40,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:40,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:40,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:40,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:40,870 INFO L87 Difference]: Start difference. First operand 18226 states and 59616 transitions. Second operand 5 states. [2018-12-09 07:08:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:40,947 INFO L93 Difference]: Finished difference Result 27347 states and 90700 transitions. [2018-12-09 07:08:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:40,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 07:08:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:40,980 INFO L225 Difference]: With dead ends: 27347 [2018-12-09 07:08:40,980 INFO L226 Difference]: Without dead ends: 27347 [2018-12-09 07:08:40,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27347 states. [2018-12-09 07:08:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27347 to 16676. [2018-12-09 07:08:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16676 states. [2018-12-09 07:08:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16676 states to 16676 states and 53990 transitions. [2018-12-09 07:08:41,200 INFO L78 Accepts]: Start accepts. Automaton has 16676 states and 53990 transitions. Word has length 99 [2018-12-09 07:08:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:41,200 INFO L480 AbstractCegarLoop]: Abstraction has 16676 states and 53990 transitions. [2018-12-09 07:08:41,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16676 states and 53990 transitions. [2018-12-09 07:08:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 07:08:41,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:41,214 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] [2018-12-09 07:08:41,214 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:41,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash -653415533, now seen corresponding path program 1 times [2018-12-09 07:08:41,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:41,269 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-09 07:08:41,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:41,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:08:41,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:41,270 INFO L87 Difference]: Start difference. First operand 16676 states and 53990 transitions. Second operand 6 states. [2018-12-09 07:08:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:41,427 INFO L93 Difference]: Finished difference Result 14948 states and 47542 transitions. [2018-12-09 07:08:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:41,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 07:08:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:41,443 INFO L225 Difference]: With dead ends: 14948 [2018-12-09 07:08:41,443 INFO L226 Difference]: Without dead ends: 14948 [2018-12-09 07:08:41,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:08:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2018-12-09 07:08:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 11537. [2018-12-09 07:08:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2018-12-09 07:08:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 37526 transitions. [2018-12-09 07:08:41,566 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 37526 transitions. Word has length 99 [2018-12-09 07:08:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:41,566 INFO L480 AbstractCegarLoop]: Abstraction has 11537 states and 37526 transitions. [2018-12-09 07:08:41,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 37526 transitions. [2018-12-09 07:08:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 07:08:41,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:41,576 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] [2018-12-09 07:08:41,576 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:41,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-09 07:08:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:41,623 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-09 07:08:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:41,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:41,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:41,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:41,624 INFO L87 Difference]: Start difference. First operand 11537 states and 37526 transitions. Second operand 5 states. [2018-12-09 07:08:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:41,774 INFO L93 Difference]: Finished difference Result 12945 states and 42038 transitions. [2018-12-09 07:08:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:41,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 07:08:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:41,788 INFO L225 Difference]: With dead ends: 12945 [2018-12-09 07:08:41,788 INFO L226 Difference]: Without dead ends: 12817 [2018-12-09 07:08:41,788 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-09 07:08:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12817 states. [2018-12-09 07:08:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12817 to 11729. [2018-12-09 07:08:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2018-12-09 07:08:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 38086 transitions. [2018-12-09 07:08:41,907 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 38086 transitions. Word has length 101 [2018-12-09 07:08:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:41,907 INFO L480 AbstractCegarLoop]: Abstraction has 11729 states and 38086 transitions. [2018-12-09 07:08:41,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 38086 transitions. [2018-12-09 07:08:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 07:08:41,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:41,920 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] [2018-12-09 07:08:41,920 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:41,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-09 07:08:41,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:41,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:42,007 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-09 07:08:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:42,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:42,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:42,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:42,008 INFO L87 Difference]: Start difference. First operand 11729 states and 38086 transitions. Second operand 7 states. [2018-12-09 07:08:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:42,212 INFO L93 Difference]: Finished difference Result 22201 states and 72476 transitions. [2018-12-09 07:08:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:42,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 07:08:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:42,224 INFO L225 Difference]: With dead ends: 22201 [2018-12-09 07:08:42,225 INFO L226 Difference]: Without dead ends: 11329 [2018-12-09 07:08:42,225 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-09 07:08:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2018-12-09 07:08:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 11069. [2018-12-09 07:08:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11069 states. [2018-12-09 07:08:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11069 states to 11069 states and 36166 transitions. [2018-12-09 07:08:42,327 INFO L78 Accepts]: Start accepts. Automaton has 11069 states and 36166 transitions. Word has length 101 [2018-12-09 07:08:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:42,327 INFO L480 AbstractCegarLoop]: Abstraction has 11069 states and 36166 transitions. [2018-12-09 07:08:42,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11069 states and 36166 transitions. [2018-12-09 07:08:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 07:08:42,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:42,336 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] [2018-12-09 07:08:42,336 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:42,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-09 07:08:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:42,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:42,404 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-09 07:08:42,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:08:42,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:42,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:08:42,405 INFO L87 Difference]: Start difference. First operand 11069 states and 36166 transitions. Second operand 7 states. [2018-12-09 07:08:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:42,612 INFO L93 Difference]: Finished difference Result 18645 states and 61540 transitions. [2018-12-09 07:08:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:42,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 07:08:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:42,621 INFO L225 Difference]: With dead ends: 18645 [2018-12-09 07:08:42,621 INFO L226 Difference]: Without dead ends: 7616 [2018-12-09 07:08:42,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-09 07:08:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-09 07:08:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-09 07:08:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-09 07:08:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-12-09 07:08:42,692 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-12-09 07:08:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:42,692 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-12-09 07:08:42,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-12-09 07:08:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 07:08:42,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:42,699 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] [2018-12-09 07:08:42,699 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:42,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-09 07:08:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:42,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:42,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:42,796 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-09 07:08:42,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:42,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 07:08:42,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:42,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 07:08:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 07:08:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:08:42,797 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-12-09 07:08:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:43,196 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-12-09 07:08:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 07:08:43,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-09 07:08:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:43,208 INFO L225 Difference]: With dead ends: 14444 [2018-12-09 07:08:43,208 INFO L226 Difference]: Without dead ends: 10540 [2018-12-09 07:08:43,208 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-09 07:08:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-09 07:08:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-09 07:08:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-09 07:08:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-12-09 07:08:43,302 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-12-09 07:08:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:43,302 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-12-09 07:08:43,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 07:08:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-12-09 07:08:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 07:08:43,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:43,310 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] [2018-12-09 07:08:43,310 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:43,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-09 07:08:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:43,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:43,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:08:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:08:43,347 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 07:08:43,411 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 07:08:43,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:08:43 BasicIcfg [2018-12-09 07:08:43,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 07:08:43,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:08:43,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:08:43,413 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:08:43,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:07:18" (3/4) ... [2018-12-09 07:08:43,415 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 07:08:43,482 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e78b7f96-0eab-42b0-b885-af5bbd35a34d/bin-2019/utaipan/witness.graphml [2018-12-09 07:08:43,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:08:43,483 INFO L168 Benchmark]: Toolchain (without parser) took 85859.02 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 951.7 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,484 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:08:43,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.14 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,484 INFO L168 Benchmark]: Boogie Preprocessor took 18.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,484 INFO L168 Benchmark]: RCFGBuilder took 345.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,485 INFO L168 Benchmark]: TraceAbstraction took 85053.02 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,485 INFO L168 Benchmark]: Witness Printer took 69.72 ms. Allocated memory is still 8.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-12-09 07:08:43,486 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.14 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85053.02 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 69.72 ms. Allocated memory is still 8.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 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] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L696] -1 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L774] -1 pthread_t t2494; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L775] FCALL, FORK -1 pthread_create(&t2494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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 t2495; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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(&t2495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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 t2496; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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(&t2496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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=2] [L752] 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, 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=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, 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=2] [L752] 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) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, 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=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] 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=1, 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=2] [L754] 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 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, 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=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] 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=1, 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=2] [L756] 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 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L723] 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=2, 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=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 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=2, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 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) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] 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=2, 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_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=2] [L725] 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 [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] 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=2, 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_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=2] [L727] 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 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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=2] [L785] 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, 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=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, 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=2] [L785] 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, 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=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, 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=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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, 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=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, 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=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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, 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=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, 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=2] [L796] 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, 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=2] [L796] -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) [L797] 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, 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=2] [L797] -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)) [L798] 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, 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=2] [L798] -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)) [L799] 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, 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=2] [L799] -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)) [L800] 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, 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=2] [L800] -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)) [L801] 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, 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=2] [L801] -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)) [L802] 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, 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=2] [L802] -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)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, 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=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, 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=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 84.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 22.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7302 SDtfs, 7433 SDslu, 17105 SDs, 0 SdLazy, 6450 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 102 SyntacticMatches, 13 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 43.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 612611 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2542 NumberOfCodeBlocks, 2542 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 550302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...