./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/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 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:48:09,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:48:09,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:48:09,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:48:09,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:48:09,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:48:09,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:48:09,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:48:09,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:48:09,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:48:09,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:48:09,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:48:09,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:48:09,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:48:09,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:48:09,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:48:09,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:48:09,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:48:09,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:48:09,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:48:09,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:48:09,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:48:09,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:48:09,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:48:09,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:48:09,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:48:09,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:48:09,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:48:09,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:48:09,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:48:09,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:48:09,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:48:09,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:48:09,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:48:09,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:48:09,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:48:09,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:48:09,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:48:09,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:48:09,273 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:48:09,273 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:48:09,273 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:48:09,273 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:48:09,274 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:48:09,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:48:09,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:48:09,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:48:09,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:48:09,276 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:48:09,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:48:09,277 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:48:09,277 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_0ea53346-804d-478c-b163-7791eb5d803e/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 -> 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 [2018-12-09 02:48:09,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:48:09,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:48:09,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:48:09,307 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:48:09,308 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:48:09,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-09 02:48:09,346 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/data/c03ff74e8/1cf3ff067db543eebfef89b1b3b038a8/FLAG4b9aba2c3 [2018-12-09 02:48:09,714 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:48:09,714 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-09 02:48:09,722 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/data/c03ff74e8/1cf3ff067db543eebfef89b1b3b038a8/FLAG4b9aba2c3 [2018-12-09 02:48:09,731 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/data/c03ff74e8/1cf3ff067db543eebfef89b1b3b038a8 [2018-12-09 02:48:09,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:48:09,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:48:09,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:48:09,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:48:09,736 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:48:09,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:48:09" (1/1) ... [2018-12-09 02:48:09,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:09, skipping insertion in model container [2018-12-09 02:48:09,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:48:09" (1/1) ... [2018-12-09 02:48:09,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:48:09,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:48:09,962 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:48:09,970 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:48:10,053 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:48:10,083 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:48:10,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10 WrapperNode [2018-12-09 02:48:10,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:48:10,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:48:10,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:48:10,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:48:10,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:48:10,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:48:10,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:48:10,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:48:10,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... [2018-12-09 02:48:10,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:48:10,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:48:10,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:48:10,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:48:10,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/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 02:48:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:48:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:48:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 02:48:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:48:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 02:48:10,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 02:48:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 02:48:10,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 02:48:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 02:48:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:48:10,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:48:10,169 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 02:48:10,469 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:48:10,469 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:48:10,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:48:10 BoogieIcfgContainer [2018-12-09 02:48:10,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:48:10,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:48:10,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:48:10,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:48:10,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:48:09" (1/3) ... [2018-12-09 02:48:10,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:48:10, skipping insertion in model container [2018-12-09 02:48:10,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:48:10" (2/3) ... [2018-12-09 02:48:10,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:48:10, skipping insertion in model container [2018-12-09 02:48:10,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:48:10" (3/3) ... [2018-12-09 02:48:10,475 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc_false-unreach-call.i [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:48:10,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 02:48:10,525 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:48:10,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 02:48:10,547 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 02:48:10,563 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:48:10,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:48:10,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:48:10,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:48:10,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:48:10,564 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:48:10,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:48:10,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:48:10,575 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 02:48:12,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 02:48:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 02:48:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 02:48:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:12,153 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] [2018-12-09 02:48:12,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:12,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-09 02:48:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:12,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:12,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:12,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:12,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:12,301 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 02:48:12,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:12,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:12,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:12,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:12,316 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 02:48:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:12,776 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 02:48:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:48:12,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 02:48:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:12,946 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 02:48:12,946 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 02:48:12,947 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 02:48:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 02:48:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 02:48:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 02:48:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 02:48:13,675 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 02:48:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:13,676 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 02:48:13,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 02:48:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 02:48:13,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:13,680 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] [2018-12-09 02:48:13,680 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:13,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-09 02:48:13,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:13,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:13,724 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 02:48:13,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:13,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:13,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:13,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:13,726 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-09 02:48:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:13,866 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-09 02:48:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:13,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 02:48:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:13,918 INFO L225 Difference]: With dead ends: 27339 [2018-12-09 02:48:13,918 INFO L226 Difference]: Without dead ends: 27339 [2018-12-09 02:48:13,918 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 02:48:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-09 02:48:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-09 02:48:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 02:48:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-09 02:48:14,421 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-09 02:48:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:14,422 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-09 02:48:14,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-09 02:48:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 02:48:14,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:14,424 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] [2018-12-09 02:48:14,424 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:14,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-09 02:48:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:14,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:14,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:14,464 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 02:48:14,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:14,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:14,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:14,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:14,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:14,465 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2018-12-09 02:48:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:14,983 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2018-12-09 02:48:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:14,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 02:48:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:15,097 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 02:48:15,098 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 02:48:15,098 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 02:48:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 02:48:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 02:48:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 02:48:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2018-12-09 02:48:15,989 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2018-12-09 02:48:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:15,990 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2018-12-09 02:48:15,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2018-12-09 02:48:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 02:48:15,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:15,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:15,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:15,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-09 02:48:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:15,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:15,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:16,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 02:48:16,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:16,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:16,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:16,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:16,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:16,052 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 5 states. [2018-12-09 02:48:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:16,599 INFO L93 Difference]: Finished difference Result 81367 states and 297636 transitions. [2018-12-09 02:48:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:16,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 02:48:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:16,744 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 02:48:16,744 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 02:48:16,744 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 02:48:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 02:48:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 02:48:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 02:48:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2018-12-09 02:48:17,614 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2018-12-09 02:48:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:17,614 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2018-12-09 02:48:17,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2018-12-09 02:48:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 02:48:17,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:17,619 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 02:48:17,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:17,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-09 02:48:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:17,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:17,639 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 02:48:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:17,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:17,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:17,640 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2018-12-09 02:48:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:17,853 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2018-12-09 02:48:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:17,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 02:48:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:18,106 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 02:48:18,106 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 02:48:18,107 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 02:48:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 02:48:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 02:48:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 02:48:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2018-12-09 02:48:18,907 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2018-12-09 02:48:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:18,907 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2018-12-09 02:48:18,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2018-12-09 02:48:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:48:18,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:18,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:18,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:18,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -860096332, now seen corresponding path program 1 times [2018-12-09 02:48:18,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:18,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:18,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 02:48:18,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:18,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:18,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:18,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:18,979 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2018-12-09 02:48:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:19,526 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2018-12-09 02:48:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:19,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:48:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:19,645 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 02:48:19,645 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 02:48:19,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:48:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 02:48:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 02:48:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 02:48:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2018-12-09 02:48:20,657 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2018-12-09 02:48:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:20,658 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2018-12-09 02:48:20,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2018-12-09 02:48:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:48:20,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:20,666 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] [2018-12-09 02:48:20,666 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:20,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1637919605, now seen corresponding path program 1 times [2018-12-09 02:48:20,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:20,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:20,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:20,715 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 02:48:20,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:20,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:20,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:20,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:20,716 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2018-12-09 02:48:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:21,486 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2018-12-09 02:48:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:48:21,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 02:48:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:21,634 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 02:48:21,634 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 02:48:21,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:48:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 02:48:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 02:48:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 02:48:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2018-12-09 02:48:22,898 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2018-12-09 02:48:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:22,898 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2018-12-09 02:48:22,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2018-12-09 02:48:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:48:22,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:22,907 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] [2018-12-09 02:48:22,907 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:22,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1769544010, now seen corresponding path program 1 times [2018-12-09 02:48:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:22,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:22,945 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 02:48:22,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:22,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:22,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:22,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:22,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:22,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:22,946 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2018-12-09 02:48:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:22,998 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2018-12-09 02:48:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:48:22,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 02:48:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:23,016 INFO L225 Difference]: With dead ends: 15375 [2018-12-09 02:48:23,016 INFO L226 Difference]: Without dead ends: 13789 [2018-12-09 02:48:23,017 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 02:48:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-09 02:48:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-09 02:48:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-09 02:48:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2018-12-09 02:48:23,156 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2018-12-09 02:48:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:23,157 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2018-12-09 02:48:23,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2018-12-09 02:48:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:48:23,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:23,158 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] [2018-12-09 02:48:23,158 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:23,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-09 02:48:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:23,199 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 02:48:23,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:23,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:23,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:23,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:23,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:23,200 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2018-12-09 02:48:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:23,461 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2018-12-09 02:48:23,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:48:23,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:48:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:23,486 INFO L225 Difference]: With dead ends: 19970 [2018-12-09 02:48:23,486 INFO L226 Difference]: Without dead ends: 19898 [2018-12-09 02:48:23,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:48:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-09 02:48:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-09 02:48:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-09 02:48:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2018-12-09 02:48:23,667 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2018-12-09 02:48:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:23,667 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2018-12-09 02:48:23,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2018-12-09 02:48:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:48:23,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:23,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:23,670 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:23,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-09 02:48:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:23,702 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 02:48:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:23,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:23,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:23,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:23,703 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2018-12-09 02:48:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:23,803 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2018-12-09 02:48:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:48:23,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 02:48:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:23,822 INFO L225 Difference]: With dead ends: 16617 [2018-12-09 02:48:23,822 INFO L226 Difference]: Without dead ends: 16617 [2018-12-09 02:48:23,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-09 02:48:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-09 02:48:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-09 02:48:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2018-12-09 02:48:23,986 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2018-12-09 02:48:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:23,986 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2018-12-09 02:48:23,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2018-12-09 02:48:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:48:23,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:23,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:23,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:23,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-09 02:48:23,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:23,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:24,044 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 02:48:24,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:24,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:24,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:24,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:24,045 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2018-12-09 02:48:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:24,312 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2018-12-09 02:48:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:48:24,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 02:48:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:24,346 INFO L225 Difference]: With dead ends: 28106 [2018-12-09 02:48:24,346 INFO L226 Difference]: Without dead ends: 28035 [2018-12-09 02:48:24,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:48:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-09 02:48:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-09 02:48:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-09 02:48:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2018-12-09 02:48:24,595 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2018-12-09 02:48:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:24,595 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2018-12-09 02:48:24,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2018-12-09 02:48:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:48:24,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:24,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:24,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:24,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1214039529, now seen corresponding path program 1 times [2018-12-09 02:48:24,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:24,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:24,621 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 02:48:24,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:24,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:24,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:24,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:24,622 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2018-12-09 02:48:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:24,759 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2018-12-09 02:48:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:24,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 02:48:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:24,779 INFO L225 Difference]: With dead ends: 18092 [2018-12-09 02:48:24,779 INFO L226 Difference]: Without dead ends: 18092 [2018-12-09 02:48:24,779 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 02:48:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-09 02:48:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-09 02:48:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-09 02:48:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2018-12-09 02:48:24,955 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2018-12-09 02:48:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:24,955 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2018-12-09 02:48:24,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2018-12-09 02:48:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:48:24,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:24,959 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 02:48:24,959 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:24,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash 863169814, now seen corresponding path program 1 times [2018-12-09 02:48:24,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:24,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:24,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:24,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:24,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:24,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:24,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:24,986 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2018-12-09 02:48:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:25,159 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2018-12-09 02:48:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:48:25,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 02:48:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:25,182 INFO L225 Difference]: With dead ends: 21696 [2018-12-09 02:48:25,182 INFO L226 Difference]: Without dead ends: 21696 [2018-12-09 02:48:25,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-09 02:48:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-09 02:48:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-09 02:48:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2018-12-09 02:48:25,386 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2018-12-09 02:48:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:25,386 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2018-12-09 02:48:25,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2018-12-09 02:48:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:25,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:25,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:25,395 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:25,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2018-12-09 02:48:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:25,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:25,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:25,441 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 02:48:25,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:25,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:25,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:25,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:25,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:25,442 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2018-12-09 02:48:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:25,960 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2018-12-09 02:48:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:48:25,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:48:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:25,985 INFO L225 Difference]: With dead ends: 23814 [2018-12-09 02:48:25,986 INFO L226 Difference]: Without dead ends: 23814 [2018-12-09 02:48:25,986 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 02:48:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-09 02:48:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-09 02:48:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-09 02:48:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2018-12-09 02:48:26,222 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2018-12-09 02:48:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:26,222 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2018-12-09 02:48:26,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2018-12-09 02:48:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:26,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:26,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:26,229 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2018-12-09 02:48:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:26,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:26,287 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 02:48:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:26,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:26,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:26,289 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2018-12-09 02:48:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:26,561 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2018-12-09 02:48:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:48:26,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:48:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:26,590 INFO L225 Difference]: With dead ends: 25702 [2018-12-09 02:48:26,590 INFO L226 Difference]: Without dead ends: 25702 [2018-12-09 02:48:26,590 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 02:48:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-09 02:48:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-09 02:48:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-09 02:48:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2018-12-09 02:48:26,833 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2018-12-09 02:48:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:26,833 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2018-12-09 02:48:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2018-12-09 02:48:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:26,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:26,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:26,840 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:26,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2018-12-09 02:48:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:26,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:26,885 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 02:48:26,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:26,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:26,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:26,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:26,886 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2018-12-09 02:48:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:27,115 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2018-12-09 02:48:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:48:27,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:48:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:27,149 INFO L225 Difference]: With dead ends: 29793 [2018-12-09 02:48:27,149 INFO L226 Difference]: Without dead ends: 29793 [2018-12-09 02:48:27,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 02:48:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-09 02:48:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-09 02:48:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-09 02:48:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2018-12-09 02:48:27,460 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2018-12-09 02:48:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2018-12-09 02:48:27,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2018-12-09 02:48:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:27,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:27,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:27,469 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:27,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2018-12-09 02:48:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:27,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:27,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:27,501 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 02:48:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:27,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:27,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:27,503 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2018-12-09 02:48:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:27,812 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2018-12-09 02:48:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:27,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:48:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:27,888 INFO L225 Difference]: With dead ends: 36420 [2018-12-09 02:48:27,888 INFO L226 Difference]: Without dead ends: 36420 [2018-12-09 02:48:27,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:48:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-09 02:48:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-09 02:48:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-09 02:48:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2018-12-09 02:48:28,213 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2018-12-09 02:48:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:28,214 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2018-12-09 02:48:28,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2018-12-09 02:48:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:28,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:28,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:28,221 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:28,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2018-12-09 02:48:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:28,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:28,261 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 02:48:28,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:28,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:28,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:28,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:28,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:28,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:28,263 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2018-12-09 02:48:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:28,647 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2018-12-09 02:48:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:48:28,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 02:48:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:28,691 INFO L225 Difference]: With dead ends: 38892 [2018-12-09 02:48:28,691 INFO L226 Difference]: Without dead ends: 38660 [2018-12-09 02:48:28,692 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 02:48:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2018-12-09 02:48:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2018-12-09 02:48:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2018-12-09 02:48:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2018-12-09 02:48:29,085 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2018-12-09 02:48:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:29,085 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2018-12-09 02:48:29,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2018-12-09 02:48:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:29,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:29,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:29,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:29,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2018-12-09 02:48:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:29,120 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 02:48:29,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:29,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:29,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:29,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:29,120 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2018-12-09 02:48:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:29,157 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-09 02:48:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:48:29,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:48:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:29,162 INFO L225 Difference]: With dead ends: 9316 [2018-12-09 02:48:29,162 INFO L226 Difference]: Without dead ends: 7464 [2018-12-09 02:48:29,162 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 02:48:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-09 02:48:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-09 02:48:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-09 02:48:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-09 02:48:29,211 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-09 02:48:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:29,211 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-09 02:48:29,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-09 02:48:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:29,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:29,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] [2018-12-09 02:48:29,214 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:29,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-09 02:48:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:29,233 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 02:48:29,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:29,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:29,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:29,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:29,234 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-09 02:48:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:29,258 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-09 02:48:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:29,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 02:48:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:29,263 INFO L225 Difference]: With dead ends: 8820 [2018-12-09 02:48:29,263 INFO L226 Difference]: Without dead ends: 8820 [2018-12-09 02:48:29,264 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 02:48:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-09 02:48:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-09 02:48:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-09 02:48:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-09 02:48:29,314 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-09 02:48:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:29,314 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-09 02:48:29,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-09 02:48:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:48:29,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:29,318 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] [2018-12-09 02:48:29,318 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:29,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:29,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-09 02:48:29,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:29,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:29,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:29,355 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 02:48:29,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:29,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:29,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:29,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:29,356 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-09 02:48:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:29,452 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-09 02:48:29,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:48:29,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 02:48:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:29,459 INFO L225 Difference]: With dead ends: 7470 [2018-12-09 02:48:29,459 INFO L226 Difference]: Without dead ends: 7470 [2018-12-09 02:48:29,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:48:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-09 02:48:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-09 02:48:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-09 02:48:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-09 02:48:29,509 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-09 02:48:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:29,509 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-09 02:48:29,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-09 02:48:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:48:29,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:29,512 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] [2018-12-09 02:48:29,512 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:29,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-09 02:48:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:29,554 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 02:48:29,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:29,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:29,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:29,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:29,555 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-09 02:48:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:29,807 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-09 02:48:29,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:48:29,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 02:48:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:29,815 INFO L225 Difference]: With dead ends: 7881 [2018-12-09 02:48:29,815 INFO L226 Difference]: Without dead ends: 7762 [2018-12-09 02:48:29,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 02:48:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-09 02:48:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-09 02:48:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-09 02:48:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-09 02:48:29,879 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-09 02:48:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:29,879 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-09 02:48:29,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-09 02:48:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 02:48:29,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:29,884 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] [2018-12-09 02:48:29,884 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:29,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash -604903176, now seen corresponding path program 1 times [2018-12-09 02:48:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:29,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:29,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:29,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:29,923 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 02:48:29,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:29,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:29,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:29,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:29,924 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-09 02:48:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:30,085 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-09 02:48:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:48:30,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 02:48:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:30,092 INFO L225 Difference]: With dead ends: 10608 [2018-12-09 02:48:30,092 INFO L226 Difference]: Without dead ends: 10608 [2018-12-09 02:48:30,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-09 02:48:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-09 02:48:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-09 02:48:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-09 02:48:30,159 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-09 02:48:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:30,159 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-09 02:48:30,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-09 02:48:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 02:48:30,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:30,165 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] [2018-12-09 02:48:30,165 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:30,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash -972140710, now seen corresponding path program 2 times [2018-12-09 02:48:30,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:30,204 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 02:48:30,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:30,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:30,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:30,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:30,205 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-09 02:48:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:30,267 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-09 02:48:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:48:30,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 02:48:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:30,273 INFO L225 Difference]: With dead ends: 8526 [2018-12-09 02:48:30,274 INFO L226 Difference]: Without dead ends: 8526 [2018-12-09 02:48:30,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-09 02:48:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-09 02:48:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-09 02:48:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-09 02:48:30,334 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-09 02:48:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:30,334 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-09 02:48:30,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:48:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-09 02:48:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:30,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:30,339 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] [2018-12-09 02:48:30,339 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:30,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1465486910, now seen corresponding path program 1 times [2018-12-09 02:48:30,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:48:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:30,394 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 02:48:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:30,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:30,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:30,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:30,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:30,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:30,395 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-12-09 02:48:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:30,822 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-12-09 02:48:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:48:30,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 02:48:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:30,828 INFO L225 Difference]: With dead ends: 9705 [2018-12-09 02:48:30,828 INFO L226 Difference]: Without dead ends: 9705 [2018-12-09 02:48:30,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 02:48:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-12-09 02:48:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-12-09 02:48:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-12-09 02:48:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-12-09 02:48:30,889 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-12-09 02:48:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:30,889 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-12-09 02:48:30,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-12-09 02:48:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:30,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:30,895 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] [2018-12-09 02:48:30,895 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:30,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 631244515, now seen corresponding path program 1 times [2018-12-09 02:48:30,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:30,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:30,942 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 02:48:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:30,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:30,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:30,943 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-12-09 02:48:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:31,015 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-12-09 02:48:31,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:48:31,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 02:48:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:31,021 INFO L225 Difference]: With dead ends: 8886 [2018-12-09 02:48:31,021 INFO L226 Difference]: Without dead ends: 8886 [2018-12-09 02:48:31,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-12-09 02:48:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-12-09 02:48:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-12-09 02:48:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-12-09 02:48:31,078 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-12-09 02:48:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:31,078 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-12-09 02:48:31,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-12-09 02:48:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:31,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:31,083 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] [2018-12-09 02:48:31,083 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:31,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:31,083 INFO L82 PathProgramCache]: Analyzing trace with hash 376507970, now seen corresponding path program 1 times [2018-12-09 02:48:31,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:31,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:31,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:48:31,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:31,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:48:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:48:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:48:31,114 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-12-09 02:48:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:31,282 INFO L93 Difference]: Finished difference Result 8123 states and 18363 transitions. [2018-12-09 02:48:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:48:31,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 02:48:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:31,287 INFO L225 Difference]: With dead ends: 8123 [2018-12-09 02:48:31,287 INFO L226 Difference]: Without dead ends: 7992 [2018-12-09 02:48:31,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 02:48:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-12-09 02:48:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7614. [2018-12-09 02:48:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-09 02:48:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17342 transitions. [2018-12-09 02:48:31,339 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17342 transitions. Word has length 94 [2018-12-09 02:48:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:31,339 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17342 transitions. [2018-12-09 02:48:31,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17342 transitions. [2018-12-09 02:48:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:31,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:31,344 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] [2018-12-09 02:48:31,344 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:31,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1621272451, now seen corresponding path program 1 times [2018-12-09 02:48:31,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:31,403 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 02:48:31,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:31,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:31,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:31,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:31,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:31,404 INFO L87 Difference]: Start difference. First operand 7614 states and 17342 transitions. Second operand 6 states. [2018-12-09 02:48:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:31,597 INFO L93 Difference]: Finished difference Result 9775 states and 22056 transitions. [2018-12-09 02:48:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:48:31,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 02:48:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:31,606 INFO L225 Difference]: With dead ends: 9775 [2018-12-09 02:48:31,606 INFO L226 Difference]: Without dead ends: 9667 [2018-12-09 02:48:31,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:48:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-12-09 02:48:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7441. [2018-12-09 02:48:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-12-09 02:48:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 16948 transitions. [2018-12-09 02:48:31,676 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 16948 transitions. Word has length 94 [2018-12-09 02:48:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:31,676 INFO L480 AbstractCegarLoop]: Abstraction has 7441 states and 16948 transitions. [2018-12-09 02:48:31,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 16948 transitions. [2018-12-09 02:48:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:31,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:31,682 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] [2018-12-09 02:48:31,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:31,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash 383295530, now seen corresponding path program 1 times [2018-12-09 02:48:31,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:31,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:31,760 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 02:48:31,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:31,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:48:31,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:31,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:48:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:48:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:48:31,761 INFO L87 Difference]: Start difference. First operand 7441 states and 16948 transitions. Second operand 9 states. [2018-12-09 02:48:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:32,063 INFO L93 Difference]: Finished difference Result 10480 states and 23807 transitions. [2018-12-09 02:48:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 02:48:32,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 02:48:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:32,070 INFO L225 Difference]: With dead ends: 10480 [2018-12-09 02:48:32,070 INFO L226 Difference]: Without dead ends: 10448 [2018-12-09 02:48:32,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 02:48:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2018-12-09 02:48:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 9009. [2018-12-09 02:48:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-09 02:48:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 20408 transitions. [2018-12-09 02:48:32,140 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 20408 transitions. Word has length 94 [2018-12-09 02:48:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 20408 transitions. [2018-12-09 02:48:32,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:48:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 20408 transitions. [2018-12-09 02:48:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:32,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:32,146 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] [2018-12-09 02:48:32,146 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:32,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1413655829, now seen corresponding path program 1 times [2018-12-09 02:48:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:32,217 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 02:48:32,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:32,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:48:32,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:32,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:48:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:48:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:48:32,218 INFO L87 Difference]: Start difference. First operand 9009 states and 20408 transitions. Second operand 8 states. [2018-12-09 02:48:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:32,448 INFO L93 Difference]: Finished difference Result 14006 states and 32226 transitions. [2018-12-09 02:48:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:48:32,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 02:48:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:32,458 INFO L225 Difference]: With dead ends: 14006 [2018-12-09 02:48:32,458 INFO L226 Difference]: Without dead ends: 14006 [2018-12-09 02:48:32,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:48:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2018-12-09 02:48:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 9587. [2018-12-09 02:48:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2018-12-09 02:48:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 21909 transitions. [2018-12-09 02:48:32,548 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 21909 transitions. Word has length 94 [2018-12-09 02:48:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 9587 states and 21909 transitions. [2018-12-09 02:48:32,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:48:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 21909 transitions. [2018-12-09 02:48:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:48:32,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:32,554 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] [2018-12-09 02:48:32,554 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:32,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -526152148, now seen corresponding path program 1 times [2018-12-09 02:48:32,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:32,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:32,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:32,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:32,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:32,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:32,590 INFO L87 Difference]: Start difference. First operand 9587 states and 21909 transitions. Second operand 3 states. [2018-12-09 02:48:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:32,614 INFO L93 Difference]: Finished difference Result 9331 states and 21109 transitions. [2018-12-09 02:48:32,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:32,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-09 02:48:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:32,620 INFO L225 Difference]: With dead ends: 9331 [2018-12-09 02:48:32,620 INFO L226 Difference]: Without dead ends: 9299 [2018-12-09 02:48:32,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 02:48:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states. [2018-12-09 02:48:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7512. [2018-12-09 02:48:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7512 states. [2018-12-09 02:48:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 16864 transitions. [2018-12-09 02:48:32,684 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 16864 transitions. Word has length 94 [2018-12-09 02:48:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:32,684 INFO L480 AbstractCegarLoop]: Abstraction has 7512 states and 16864 transitions. [2018-12-09 02:48:32,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 16864 transitions. [2018-12-09 02:48:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:32,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:32,689 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] [2018-12-09 02:48:32,689 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:32,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1587470612, now seen corresponding path program 1 times [2018-12-09 02:48:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:32,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:32,788 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 02:48:32,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:32,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:48:32,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:32,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:48:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:48:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:48:32,789 INFO L87 Difference]: Start difference. First operand 7512 states and 16864 transitions. Second operand 9 states. [2018-12-09 02:48:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:33,121 INFO L93 Difference]: Finished difference Result 9618 states and 21293 transitions. [2018-12-09 02:48:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 02:48:33,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 02:48:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:33,127 INFO L225 Difference]: With dead ends: 9618 [2018-12-09 02:48:33,127 INFO L226 Difference]: Without dead ends: 9618 [2018-12-09 02:48:33,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-09 02:48:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2018-12-09 02:48:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 8157. [2018-12-09 02:48:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8157 states. [2018-12-09 02:48:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8157 states to 8157 states and 18196 transitions. [2018-12-09 02:48:33,187 INFO L78 Accepts]: Start accepts. Automaton has 8157 states and 18196 transitions. Word has length 96 [2018-12-09 02:48:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:33,188 INFO L480 AbstractCegarLoop]: Abstraction has 8157 states and 18196 transitions. [2018-12-09 02:48:33,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:48:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8157 states and 18196 transitions. [2018-12-09 02:48:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:33,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:33,193 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] [2018-12-09 02:48:33,193 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:33,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1376119699, now seen corresponding path program 1 times [2018-12-09 02:48:33,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:33,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:33,307 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 02:48:33,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:33,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 02:48:33,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:33,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 02:48:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 02:48:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:48:33,307 INFO L87 Difference]: Start difference. First operand 8157 states and 18196 transitions. Second operand 13 states. [2018-12-09 02:48:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:33,955 INFO L93 Difference]: Finished difference Result 11618 states and 25550 transitions. [2018-12-09 02:48:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 02:48:33,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-12-09 02:48:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:33,965 INFO L225 Difference]: With dead ends: 11618 [2018-12-09 02:48:33,965 INFO L226 Difference]: Without dead ends: 11618 [2018-12-09 02:48:33,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 02:48:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11618 states. [2018-12-09 02:48:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11618 to 8808. [2018-12-09 02:48:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8808 states. [2018-12-09 02:48:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 19682 transitions. [2018-12-09 02:48:34,041 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 19682 transitions. Word has length 96 [2018-12-09 02:48:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:34,041 INFO L480 AbstractCegarLoop]: Abstraction has 8808 states and 19682 transitions. [2018-12-09 02:48:34,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 02:48:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 19682 transitions. [2018-12-09 02:48:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:34,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:34,048 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] [2018-12-09 02:48:34,048 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:34,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -488616018, now seen corresponding path program 1 times [2018-12-09 02:48:34,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:34,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:34,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:34,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:34,147 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 02:48:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 02:48:34,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:34,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:48:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:48:34,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:48:34,148 INFO L87 Difference]: Start difference. First operand 8808 states and 19682 transitions. Second operand 11 states. [2018-12-09 02:48:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:35,094 INFO L93 Difference]: Finished difference Result 16128 states and 36229 transitions. [2018-12-09 02:48:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:48:35,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 02:48:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:35,101 INFO L225 Difference]: With dead ends: 16128 [2018-12-09 02:48:35,101 INFO L226 Difference]: Without dead ends: 11177 [2018-12-09 02:48:35,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 02:48:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2018-12-09 02:48:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 8540. [2018-12-09 02:48:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8540 states. [2018-12-09 02:48:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8540 states to 8540 states and 19067 transitions. [2018-12-09 02:48:35,169 INFO L78 Accepts]: Start accepts. Automaton has 8540 states and 19067 transitions. Word has length 96 [2018-12-09 02:48:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:35,169 INFO L480 AbstractCegarLoop]: Abstraction has 8540 states and 19067 transitions. [2018-12-09 02:48:35,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:48:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8540 states and 19067 transitions. [2018-12-09 02:48:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:35,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:35,175 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] [2018-12-09 02:48:35,175 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:35,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash 537589784, now seen corresponding path program 1 times [2018-12-09 02:48:35,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:35,248 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 02:48:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:35,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:35,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:35,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:35,249 INFO L87 Difference]: Start difference. First operand 8540 states and 19067 transitions. Second operand 6 states. [2018-12-09 02:48:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:35,390 INFO L93 Difference]: Finished difference Result 7622 states and 16741 transitions. [2018-12-09 02:48:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:48:35,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:48:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:35,395 INFO L225 Difference]: With dead ends: 7622 [2018-12-09 02:48:35,396 INFO L226 Difference]: Without dead ends: 7622 [2018-12-09 02:48:35,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2018-12-09 02:48:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 7143. [2018-12-09 02:48:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7143 states. [2018-12-09 02:48:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 15734 transitions. [2018-12-09 02:48:35,448 INFO L78 Accepts]: Start accepts. Automaton has 7143 states and 15734 transitions. Word has length 96 [2018-12-09 02:48:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:35,448 INFO L480 AbstractCegarLoop]: Abstraction has 7143 states and 15734 transitions. [2018-12-09 02:48:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7143 states and 15734 transitions. [2018-12-09 02:48:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:35,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:35,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:35,454 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:35,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1266537225, now seen corresponding path program 1 times [2018-12-09 02:48:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:35,541 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 02:48:35,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:35,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:35,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:35,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:35,542 INFO L87 Difference]: Start difference. First operand 7143 states and 15734 transitions. Second operand 7 states. [2018-12-09 02:48:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:35,740 INFO L93 Difference]: Finished difference Result 9361 states and 20510 transitions. [2018-12-09 02:48:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:48:35,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:48:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:35,746 INFO L225 Difference]: With dead ends: 9361 [2018-12-09 02:48:35,746 INFO L226 Difference]: Without dead ends: 9337 [2018-12-09 02:48:35,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:48:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9337 states. [2018-12-09 02:48:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9337 to 7491. [2018-12-09 02:48:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2018-12-09 02:48:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 16504 transitions. [2018-12-09 02:48:35,803 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 16504 transitions. Word has length 96 [2018-12-09 02:48:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:35,803 INFO L480 AbstractCegarLoop]: Abstraction has 7491 states and 16504 transitions. [2018-12-09 02:48:35,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 16504 transitions. [2018-12-09 02:48:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:35,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:35,808 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] [2018-12-09 02:48:35,808 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:35,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2066816054, now seen corresponding path program 2 times [2018-12-09 02:48:35,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:35,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:35,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:35,868 INFO L87 Difference]: Start difference. First operand 7491 states and 16504 transitions. Second operand 7 states. [2018-12-09 02:48:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:36,069 INFO L93 Difference]: Finished difference Result 8688 states and 19201 transitions. [2018-12-09 02:48:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:36,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:48:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:36,075 INFO L225 Difference]: With dead ends: 8688 [2018-12-09 02:48:36,075 INFO L226 Difference]: Without dead ends: 8688 [2018-12-09 02:48:36,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:48:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2018-12-09 02:48:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 7708. [2018-12-09 02:48:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7708 states. [2018-12-09 02:48:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7708 states to 7708 states and 16946 transitions. [2018-12-09 02:48:36,132 INFO L78 Accepts]: Start accepts. Automaton has 7708 states and 16946 transitions. Word has length 96 [2018-12-09 02:48:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:36,132 INFO L480 AbstractCegarLoop]: Abstraction has 7708 states and 16946 transitions. [2018-12-09 02:48:36,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7708 states and 16946 transitions. [2018-12-09 02:48:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:36,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:36,138 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] [2018-12-09 02:48:36,138 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:36,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1184419848, now seen corresponding path program 1 times [2018-12-09 02:48:36,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:36,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:48:36,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:36,183 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 02:48:36,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:36,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:36,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:36,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:36,183 INFO L87 Difference]: Start difference. First operand 7708 states and 16946 transitions. Second operand 6 states. [2018-12-09 02:48:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:36,472 INFO L93 Difference]: Finished difference Result 10649 states and 23221 transitions. [2018-12-09 02:48:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:48:36,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:48:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:36,479 INFO L225 Difference]: With dead ends: 10649 [2018-12-09 02:48:36,479 INFO L226 Difference]: Without dead ends: 10487 [2018-12-09 02:48:36,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:48:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2018-12-09 02:48:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 8465. [2018-12-09 02:48:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8465 states. [2018-12-09 02:48:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 18676 transitions. [2018-12-09 02:48:36,544 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 18676 transitions. Word has length 96 [2018-12-09 02:48:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:36,544 INFO L480 AbstractCegarLoop]: Abstraction has 8465 states and 18676 transitions. [2018-12-09 02:48:36,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 18676 transitions. [2018-12-09 02:48:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:36,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:36,551 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] [2018-12-09 02:48:36,552 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:36,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1395770761, now seen corresponding path program 1 times [2018-12-09 02:48:36,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:36,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 02:48:36,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:36,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:36,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:36,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:36,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:36,601 INFO L87 Difference]: Start difference. First operand 8465 states and 18676 transitions. Second operand 6 states. [2018-12-09 02:48:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:36,826 INFO L93 Difference]: Finished difference Result 9364 states and 20420 transitions. [2018-12-09 02:48:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:48:36,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:48:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:36,833 INFO L225 Difference]: With dead ends: 9364 [2018-12-09 02:48:36,833 INFO L226 Difference]: Without dead ends: 9257 [2018-12-09 02:48:36,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:48:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2018-12-09 02:48:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 8391. [2018-12-09 02:48:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2018-12-09 02:48:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 18414 transitions. [2018-12-09 02:48:36,912 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 18414 transitions. Word has length 96 [2018-12-09 02:48:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:36,912 INFO L480 AbstractCegarLoop]: Abstraction has 8391 states and 18414 transitions. [2018-12-09 02:48:36,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 18414 transitions. [2018-12-09 02:48:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:36,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:36,919 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] [2018-12-09 02:48:36,919 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:36,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1877521545, now seen corresponding path program 1 times [2018-12-09 02:48:36,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:36,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:37,049 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 02:48:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:37,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:48:37,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:37,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:48:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:48:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:48:37,050 INFO L87 Difference]: Start difference. First operand 8391 states and 18414 transitions. Second operand 9 states. [2018-12-09 02:48:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:37,454 INFO L93 Difference]: Finished difference Result 10294 states and 22323 transitions. [2018-12-09 02:48:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:48:37,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 02:48:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:37,470 INFO L225 Difference]: With dead ends: 10294 [2018-12-09 02:48:37,470 INFO L226 Difference]: Without dead ends: 10294 [2018-12-09 02:48:37,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:48:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2018-12-09 02:48:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8718. [2018-12-09 02:48:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8718 states. [2018-12-09 02:48:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 19083 transitions. [2018-12-09 02:48:37,564 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 19083 transitions. Word has length 96 [2018-12-09 02:48:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:37,564 INFO L480 AbstractCegarLoop]: Abstraction has 8718 states and 19083 transitions. [2018-12-09 02:48:37,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:48:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 19083 transitions. [2018-12-09 02:48:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:37,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:37,569 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] [2018-12-09 02:48:37,569 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:37,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash 827237257, now seen corresponding path program 1 times [2018-12-09 02:48:37,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:37,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:37,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:37,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:37,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:37,641 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 02:48:37,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:37,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:48:37,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:37,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:48:37,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:48:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:48:37,642 INFO L87 Difference]: Start difference. First operand 8718 states and 19083 transitions. Second operand 8 states. [2018-12-09 02:48:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:38,053 INFO L93 Difference]: Finished difference Result 11773 states and 25703 transitions. [2018-12-09 02:48:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:48:38,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 02:48:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:38,060 INFO L225 Difference]: With dead ends: 11773 [2018-12-09 02:48:38,060 INFO L226 Difference]: Without dead ends: 11705 [2018-12-09 02:48:38,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-09 02:48:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11705 states. [2018-12-09 02:48:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11705 to 8959. [2018-12-09 02:48:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2018-12-09 02:48:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 19610 transitions. [2018-12-09 02:48:38,135 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 19610 transitions. Word has length 96 [2018-12-09 02:48:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:38,135 INFO L480 AbstractCegarLoop]: Abstraction has 8959 states and 19610 transitions. [2018-12-09 02:48:38,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:48:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 19610 transitions. [2018-12-09 02:48:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:38,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:38,140 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] [2018-12-09 02:48:38,141 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:38,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1249972086, now seen corresponding path program 2 times [2018-12-09 02:48:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:38,192 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 02:48:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:38,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:38,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:38,193 INFO L87 Difference]: Start difference. First operand 8959 states and 19610 transitions. Second operand 7 states. [2018-12-09 02:48:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:38,289 INFO L93 Difference]: Finished difference Result 11470 states and 25260 transitions. [2018-12-09 02:48:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:48:38,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:48:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:38,297 INFO L225 Difference]: With dead ends: 11470 [2018-12-09 02:48:38,297 INFO L226 Difference]: Without dead ends: 11470 [2018-12-09 02:48:38,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:48:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2018-12-09 02:48:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7965. [2018-12-09 02:48:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7965 states. [2018-12-09 02:48:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 17356 transitions. [2018-12-09 02:48:38,370 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 17356 transitions. Word has length 96 [2018-12-09 02:48:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:38,370 INFO L480 AbstractCegarLoop]: Abstraction has 7965 states and 17356 transitions. [2018-12-09 02:48:38,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 17356 transitions. [2018-12-09 02:48:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:38,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:38,376 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] [2018-12-09 02:48:38,376 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:38,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash -556870389, now seen corresponding path program 2 times [2018-12-09 02:48:38,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:48:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:38,472 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 02:48:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 02:48:38,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:38,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:48:38,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:48:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:48:38,473 INFO L87 Difference]: Start difference. First operand 7965 states and 17356 transitions. Second operand 11 states. [2018-12-09 02:48:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:38,817 INFO L93 Difference]: Finished difference Result 10008 states and 21742 transitions. [2018-12-09 02:48:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 02:48:38,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 02:48:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:38,823 INFO L225 Difference]: With dead ends: 10008 [2018-12-09 02:48:38,823 INFO L226 Difference]: Without dead ends: 10008 [2018-12-09 02:48:38,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-09 02:48:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10008 states. [2018-12-09 02:48:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10008 to 7802. [2018-12-09 02:48:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7802 states. [2018-12-09 02:48:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7802 states to 7802 states and 17004 transitions. [2018-12-09 02:48:38,883 INFO L78 Accepts]: Start accepts. Automaton has 7802 states and 17004 transitions. Word has length 96 [2018-12-09 02:48:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:38,883 INFO L480 AbstractCegarLoop]: Abstraction has 7802 states and 17004 transitions. [2018-12-09 02:48:38,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:48:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7802 states and 17004 transitions. [2018-12-09 02:48:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:48:38,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:38,888 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] [2018-12-09 02:48:38,888 INFO L423 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:38,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 330633292, now seen corresponding path program 2 times [2018-12-09 02:48:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:48:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:38,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:48:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:48:38,929 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:48:39,010 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 02:48:39,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:48:39 BasicIcfg [2018-12-09 02:48:39,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:48:39,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:48:39,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:48:39,012 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:48:39,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:48:10" (3/4) ... [2018-12-09 02:48:39,015 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:48:39,109 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ea53346-804d-478c-b163-7791eb5d803e/bin-2019/utaipan/witness.graphml [2018-12-09 02:48:39,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:48:39,110 INFO L168 Benchmark]: Toolchain (without parser) took 29377.47 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 956.0 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,111 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:48:39,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.98 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,112 INFO L168 Benchmark]: Boogie Preprocessor took 20.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:48:39,112 INFO L168 Benchmark]: RCFGBuilder took 334.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,112 INFO L168 Benchmark]: TraceAbstraction took 28541.47 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 953.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,113 INFO L168 Benchmark]: Witness Printer took 97.42 ms. Allocated memory is still 4.1 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2018-12-09 02:48:39,114 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.98 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 334.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28541.47 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 953.1 MB. Max. memory is 11.5 GB. * Witness Printer took 97.42 ms. Allocated memory is still 4.1 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1611; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1612; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 28.4s OverallTime, 44 OverallIterations, 1 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11487 SDtfs, 12911 SDslu, 28709 SDs, 0 SdLazy, 14271 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 114 SyntacticMatches, 42 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred 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: 10.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 189328 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3391 NumberOfCodeBlocks, 3391 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3252 ConstructedInterpolants, 0 QuantifiedInterpolants, 873382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...