./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_tso.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_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/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 a4a4d2e67bbd8206d7e1e6a814362d1d3f7ab891 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:42:26,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:42:26,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:42:26,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:42:26,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:42:26,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:42:26,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:42:26,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:42:26,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:42:26,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:42:26,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:42:26,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:42:26,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:42:26,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:42:26,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:42:26,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:42:26,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:42:26,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:42:26,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:42:26,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:42:26,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:42:26,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:42:26,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:42:26,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:42:26,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:42:26,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:42:26,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:42:26,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:42:26,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:42:26,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:42:26,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:42:26,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:42:26,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:42:26,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:42:26,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:42:26,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:42:26,529 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:42:26,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:42:26,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:42:26,537 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:42:26,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:42:26,537 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:42:26,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:42:26,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:42:26,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:42:26,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:42:26,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:42:26,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:42:26,540 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_59579e60-28c0-496d-b86a-44dfd4ca19a6/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 -> a4a4d2e67bbd8206d7e1e6a814362d1d3f7ab891 [2018-12-09 02:42:26,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:42:26,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:42:26,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:42:26,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:42:26,567 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:42:26,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i [2018-12-09 02:42:26,601 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/data/5559ef4a2/f675e676ae4343209d8fd0d78bc8019d/FLAGbab17528f [2018-12-09 02:42:27,038 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:42:27,038 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/sv-benchmarks/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i [2018-12-09 02:42:27,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/data/5559ef4a2/f675e676ae4343209d8fd0d78bc8019d/FLAGbab17528f [2018-12-09 02:42:27,054 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/data/5559ef4a2/f675e676ae4343209d8fd0d78bc8019d [2018-12-09 02:42:27,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:42:27,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:42:27,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:42:27,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:42:27,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:42:27,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27, skipping insertion in model container [2018-12-09 02:42:27,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:42:27,086 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:42:27,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:42:27,269 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:42:27,355 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:42:27,390 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:42:27,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27 WrapperNode [2018-12-09 02:42:27,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:42:27,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:42:27,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:42:27,391 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:42:27,397 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:42:27" (1/1) ... [2018-12-09 02:42:27,410 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:42:27" (1/1) ... [2018-12-09 02:42:27,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:42:27,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:42:27,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:42:27,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:42:27,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... [2018-12-09 02:42:27,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:42:27,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:42:27,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:42:27,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:42:27,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/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:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 02:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 02:42:27,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 02:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 02:42:27,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 02:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 02:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:42:27,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:42:27,492 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:42:27,780 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:42:27,781 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:42:27,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:27 BoogieIcfgContainer [2018-12-09 02:42:27,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:42:27,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:42:27,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:42:27,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:42:27,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:42:27" (1/3) ... [2018-12-09 02:42:27,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4bd27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:42:27, skipping insertion in model container [2018-12-09 02:42:27,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:27" (2/3) ... [2018-12-09 02:42:27,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4bd27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:42:27, skipping insertion in model container [2018-12-09 02:42:27,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:27" (3/3) ... [2018-12-09 02:42:27,786 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_tso.oepc_false-unreach-call.i [2018-12-09 02:42:27,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 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:42:27,810 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,810 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,811 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:42:27,828 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 02:42:27,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:42:27,834 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 02:42:27,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 02:42:27,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:42:27,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:42:27,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:42:27,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:42:27,859 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:42:27,859 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:42:27,859 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:42:27,859 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:42:27,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 02:42:29,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 02:42:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 02:42:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 02:42:29,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:29,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:29,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:29,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-09 02:42:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:29,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:29,567 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:42:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:29,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:29,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:29,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:29,582 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 02:42:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:30,089 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 02:42:30,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:30,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 02:42:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:30,237 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 02:42:30,237 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 02:42:30,238 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:42:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 02:42:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 02:42:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 02:42:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 02:42:30,984 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 02:42:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 02:42:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 02:42:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 02:42:30,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:30,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] [2018-12-09 02:42:30,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:30,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-09 02:42:30,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:30,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:30,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:31,047 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:42:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:31,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:31,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:31,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:31,049 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-09 02:42:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:31,551 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-09 02:42:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:31,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 02:42:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:31,792 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 02:42:31,792 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 02:42:31,793 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:42:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 02:42:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 02:42:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 02:42:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-09 02:42:32,520 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-09 02:42:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:32,521 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-09 02:42:32,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-09 02:42:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 02:42:32,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:32,524 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:42:32,524 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:32,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-09 02:42:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:32,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:32,591 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:42:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:32,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:32,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:32,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:32,592 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-09 02:42:32,765 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-12-09 02:42:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:33,095 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-09 02:42:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:33,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 02:42:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:33,235 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 02:42:33,235 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 02:42:33,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 02:42:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 02:42:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 02:42:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-09 02:42:34,198 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-09 02:42:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:34,198 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-09 02:42:34,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-09 02:42:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 02:42:34,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:34,203 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:42:34,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:34,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-09 02:42:34,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:34,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,225 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:42:34,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:34,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:34,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:34,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:34,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:34,226 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-09 02:42:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:34,439 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-09 02:42:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:34,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 02:42:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:34,545 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 02:42:34,545 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 02:42:34,546 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:42:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 02:42:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 02:42:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 02:42:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-09 02:42:35,516 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-09 02:42:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:35,516 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-09 02:42:35,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-09 02:42:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:35,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:35,523 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:42:35,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:35,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-09 02:42:35,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,612 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:42:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:35,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:35,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:35,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:35,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:35,613 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-09 02:42:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:36,155 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-09 02:42:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:36,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:42:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:36,273 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 02:42:36,274 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 02:42:36,274 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:42:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 02:42:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 02:42:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 02:42:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-09 02:42:37,298 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-09 02:42:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:37,299 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-09 02:42:37,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-09 02:42:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:37,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:37,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:37,307 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:37,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-09 02:42:37,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,364 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:42:37,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:37,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:37,365 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-09 02:42:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:38,249 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-09 02:42:38,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:38,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 02:42:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:38,393 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 02:42:38,393 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 02:42:38,393 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:42:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 02:42:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 02:42:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 02:42:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-09 02:42:39,729 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-09 02:42:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:39,729 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-09 02:42:39,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-09 02:42:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:39,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:39,737 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:42:39,737 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:39,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-09 02:42:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,778 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:42:39,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:39,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:39,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:39,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:39,779 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-09 02:42:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:39,965 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-09 02:42:39,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:39,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 02:42:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:40,066 INFO L225 Difference]: With dead ends: 57182 [2018-12-09 02:42:40,067 INFO L226 Difference]: Without dead ends: 57182 [2018-12-09 02:42:40,067 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:42:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-09 02:42:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-09 02:42:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-09 02:42:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-09 02:42:40,863 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-09 02:42:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:40,863 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-09 02:42:40,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-09 02:42:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:40,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:40,869 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:42:40,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:40,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-09 02:42:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:40,918 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:42:40,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:40,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:40,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:40,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:40,919 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-09 02:42:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:41,426 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-09 02:42:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:42:41,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:42:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:41,716 INFO L225 Difference]: With dead ends: 97908 [2018-12-09 02:42:41,716 INFO L226 Difference]: Without dead ends: 97332 [2018-12-09 02:42:41,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 02:42:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-09 02:42:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-09 02:42:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-09 02:42:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-09 02:42:42,698 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-09 02:42:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:42,699 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-09 02:42:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-09 02:42:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 02:42:42,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:42,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:42,706 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:42,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-09 02:42:42,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:42,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:42,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:42,765 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:42:42,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:42,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:42,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:42,765 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-09 02:42:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:43,037 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-09 02:42:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:43,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 02:42:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:43,130 INFO L225 Difference]: With dead ends: 56810 [2018-12-09 02:42:43,130 INFO L226 Difference]: Without dead ends: 56810 [2018-12-09 02:42:43,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-09 02:42:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-09 02:42:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-09 02:42:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-09 02:42:43,928 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-09 02:42:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:43,928 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-09 02:42:43,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-09 02:42:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 02:42:43,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:43,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:43,935 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:43,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-09 02:42:43,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:43,955 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:42:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:43,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:43,956 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-09 02:42:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:43,993 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-09 02:42:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:43,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 02:42:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:44,005 INFO L225 Difference]: With dead ends: 12705 [2018-12-09 02:42:44,005 INFO L226 Difference]: Without dead ends: 10887 [2018-12-09 02:42:44,006 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:42:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-09 02:42:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-09 02:42:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-09 02:42:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-09 02:42:44,107 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-09 02:42:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:44,107 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-09 02:42:44,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-09 02:42:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:42:44,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:44,109 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:42:44,110 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-09 02:42:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:44,130 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:42:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:44,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:44,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:44,131 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-09 02:42:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:44,220 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-09 02:42:44,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:44,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 02:42:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:44,233 INFO L225 Difference]: With dead ends: 12386 [2018-12-09 02:42:44,234 INFO L226 Difference]: Without dead ends: 12386 [2018-12-09 02:42:44,234 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:42:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-09 02:42:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-09 02:42:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-09 02:42:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-09 02:42:44,348 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-09 02:42:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-09 02:42:44,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-09 02:42:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:42:44,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:44,351 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:42:44,351 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-09 02:42:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:44,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:44,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:44,390 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-09 02:42:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:44,635 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-09 02:42:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:42:44,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 02:42:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:44,654 INFO L225 Difference]: With dead ends: 20935 [2018-12-09 02:42:44,654 INFO L226 Difference]: Without dead ends: 20864 [2018-12-09 02:42:44,655 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:42:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-09 02:42:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-09 02:42:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-09 02:42:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-09 02:42:44,814 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-09 02:42:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:44,814 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-09 02:42:44,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-09 02:42:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:44,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:44,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:44,818 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:44,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-09 02:42:44,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:44,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:44,841 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:42:44,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:44,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:44,842 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-09 02:42:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:44,961 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-09 02:42:44,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:44,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 02:42:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:44,975 INFO L225 Difference]: With dead ends: 13930 [2018-12-09 02:42:44,976 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 02:42:44,976 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:42:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 02:42:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-09 02:42:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-09 02:42:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-09 02:42:45,103 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-09 02:42:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:45,104 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-09 02:42:45,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-09 02:42:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:45,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:45,109 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:42:45,109 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:45,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:45,110 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-09 02:42:45,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:45,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:45,160 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:42:45,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:45,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:45,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:45,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:45,161 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-09 02:42:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:45,332 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-09 02:42:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:45,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 02:42:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:45,349 INFO L225 Difference]: With dead ends: 17463 [2018-12-09 02:42:45,349 INFO L226 Difference]: Without dead ends: 17463 [2018-12-09 02:42:45,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:42:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-09 02:42:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-09 02:42:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-09 02:42:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-09 02:42:45,512 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-09 02:42:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:45,513 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-09 02:42:45,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-09 02:42:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:45,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:45,517 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:42:45,518 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:45,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-09 02:42:45,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:45,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:45,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:45,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:45,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:45,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:45,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:45,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:45,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:45,562 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-09 02:42:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:46,079 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-09 02:42:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:46,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:42:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:46,097 INFO L225 Difference]: With dead ends: 18862 [2018-12-09 02:42:46,098 INFO L226 Difference]: Without dead ends: 18862 [2018-12-09 02:42:46,098 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:42:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-09 02:42:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-09 02:42:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-09 02:42:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-09 02:42:46,272 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-09 02:42:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:46,272 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-09 02:42:46,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-09 02:42:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:46,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:46,278 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:42:46,278 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:46,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-09 02:42:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:46,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:46,331 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:42:46,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:46,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:46,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:46,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:46,332 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-09 02:42:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:46,576 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-09 02:42:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:46,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:42:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:46,596 INFO L225 Difference]: With dead ends: 20389 [2018-12-09 02:42:46,596 INFO L226 Difference]: Without dead ends: 20389 [2018-12-09 02:42:46,596 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:42:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-09 02:42:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-09 02:42:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-09 02:42:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-09 02:42:46,777 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-09 02:42:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:46,777 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-09 02:42:46,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-09 02:42:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:46,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:46,784 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:42:46,784 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-09 02:42:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:46,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:46,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:46,814 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:42:46,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:46,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:46,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:46,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:46,815 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-09 02:42:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:47,024 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-09 02:42:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:47,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:42:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:47,046 INFO L225 Difference]: With dead ends: 23413 [2018-12-09 02:42:47,047 INFO L226 Difference]: Without dead ends: 23413 [2018-12-09 02:42:47,047 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:42:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-09 02:42:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-09 02:42:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-09 02:42:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-09 02:42:47,264 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-09 02:42:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:47,265 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-09 02:42:47,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-09 02:42:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:47,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:47,271 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:42:47,271 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:47,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-09 02:42:47,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:47,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:47,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:47,324 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:42:47,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:47,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:47,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:47,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:47,325 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-09 02:42:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:47,623 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-09 02:42:47,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:47,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 02:42:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:47,650 INFO L225 Difference]: With dead ends: 26638 [2018-12-09 02:42:47,650 INFO L226 Difference]: Without dead ends: 26342 [2018-12-09 02:42:47,651 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:42:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-09 02:42:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-09 02:42:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-09 02:42:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-09 02:42:47,914 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-09 02:42:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:47,914 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-09 02:42:47,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-09 02:42:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:47,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:47,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:47,920 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:47,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-09 02:42:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:47,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:47,994 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:42:47,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:47,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:42:47,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:47,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:42:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:42:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:42:47,995 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 9 states. [2018-12-09 02:42:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:48,563 INFO L93 Difference]: Finished difference Result 33549 states and 97842 transitions. [2018-12-09 02:42:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:42:48,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-09 02:42:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:48,599 INFO L225 Difference]: With dead ends: 33549 [2018-12-09 02:42:48,599 INFO L226 Difference]: Without dead ends: 33549 [2018-12-09 02:42:48,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:42:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33549 states. [2018-12-09 02:42:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33549 to 29021. [2018-12-09 02:42:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29021 states. [2018-12-09 02:42:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29021 states to 29021 states and 84668 transitions. [2018-12-09 02:42:48,916 INFO L78 Accepts]: Start accepts. Automaton has 29021 states and 84668 transitions. Word has length 67 [2018-12-09 02:42:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:48,916 INFO L480 AbstractCegarLoop]: Abstraction has 29021 states and 84668 transitions. [2018-12-09 02:42:48,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:42:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 29021 states and 84668 transitions. [2018-12-09 02:42:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:48,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:48,923 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:42:48,923 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:48,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2142837968, now seen corresponding path program 1 times [2018-12-09 02:42:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:48,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:48,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:48,949 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:42:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:48,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:48,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:48,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:48,951 INFO L87 Difference]: Start difference. First operand 29021 states and 84668 transitions. Second operand 5 states. [2018-12-09 02:42:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:48,988 INFO L93 Difference]: Finished difference Result 7701 states and 18578 transitions. [2018-12-09 02:42:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:48,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:42:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:48,994 INFO L225 Difference]: With dead ends: 7701 [2018-12-09 02:42:48,994 INFO L226 Difference]: Without dead ends: 6251 [2018-12-09 02:42:48,995 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:42:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2018-12-09 02:42:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 5430. [2018-12-09 02:42:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5430 states. [2018-12-09 02:42:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 12664 transitions. [2018-12-09 02:42:49,049 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 12664 transitions. Word has length 67 [2018-12-09 02:42:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:49,050 INFO L480 AbstractCegarLoop]: Abstraction has 5430 states and 12664 transitions. [2018-12-09 02:42:49,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 12664 transitions. [2018-12-09 02:42:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:49,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:49,053 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:42:49,053 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:49,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-09 02:42:49,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:49,066 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:42:49,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:49,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:49,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:49,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:49,067 INFO L87 Difference]: Start difference. First operand 5430 states and 12664 transitions. Second operand 3 states. [2018-12-09 02:42:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:49,089 INFO L93 Difference]: Finished difference Result 7040 states and 16231 transitions. [2018-12-09 02:42:49,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:49,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 02:42:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:49,094 INFO L225 Difference]: With dead ends: 7040 [2018-12-09 02:42:49,094 INFO L226 Difference]: Without dead ends: 7040 [2018-12-09 02:42:49,094 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:42:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2018-12-09 02:42:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 5367. [2018-12-09 02:42:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5367 states. [2018-12-09 02:42:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 12202 transitions. [2018-12-09 02:42:49,136 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 12202 transitions. Word has length 67 [2018-12-09 02:42:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:49,137 INFO L480 AbstractCegarLoop]: Abstraction has 5367 states and 12202 transitions. [2018-12-09 02:42:49,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 12202 transitions. [2018-12-09 02:42:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:42:49,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:49,141 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:42:49,141 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:49,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-09 02:42:49,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:49,177 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:42:49,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:49,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:49,178 INFO L87 Difference]: Start difference. First operand 5367 states and 12202 transitions. Second operand 5 states. [2018-12-09 02:42:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:49,269 INFO L93 Difference]: Finished difference Result 6531 states and 14826 transitions. [2018-12-09 02:42:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:49,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 02:42:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:49,273 INFO L225 Difference]: With dead ends: 6531 [2018-12-09 02:42:49,274 INFO L226 Difference]: Without dead ends: 6531 [2018-12-09 02:42:49,274 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:42:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2018-12-09 02:42:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 5811. [2018-12-09 02:42:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5811 states. [2018-12-09 02:42:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 13206 transitions. [2018-12-09 02:42:49,313 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 13206 transitions. Word has length 73 [2018-12-09 02:42:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:49,313 INFO L480 AbstractCegarLoop]: Abstraction has 5811 states and 13206 transitions. [2018-12-09 02:42:49,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 13206 transitions. [2018-12-09 02:42:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:42:49,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:49,316 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:42:49,317 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:49,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-09 02:42:49,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:49,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:49,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:49,359 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:42:49,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:49,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:49,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:49,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:49,360 INFO L87 Difference]: Start difference. First operand 5811 states and 13206 transitions. Second operand 7 states. [2018-12-09 02:42:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:49,566 INFO L93 Difference]: Finished difference Result 7005 states and 15751 transitions. [2018-12-09 02:42:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:42:49,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 02:42:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:49,571 INFO L225 Difference]: With dead ends: 7005 [2018-12-09 02:42:49,571 INFO L226 Difference]: Without dead ends: 6886 [2018-12-09 02:42:49,571 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:42:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-09 02:42:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 5900. [2018-12-09 02:42:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5900 states. [2018-12-09 02:42:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 13275 transitions. [2018-12-09 02:42:49,613 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 13275 transitions. Word has length 73 [2018-12-09 02:42:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:49,613 INFO L480 AbstractCegarLoop]: Abstraction has 5900 states and 13275 transitions. [2018-12-09 02:42:49,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 13275 transitions. [2018-12-09 02:42:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:42:49,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:49,616 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:42:49,617 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:49,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-09 02:42:49,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:49,658 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:42:49,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:49,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:49,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:49,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:49,659 INFO L87 Difference]: Start difference. First operand 5900 states and 13275 transitions. Second operand 5 states. [2018-12-09 02:42:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:49,823 INFO L93 Difference]: Finished difference Result 5452 states and 12136 transitions. [2018-12-09 02:42:49,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:49,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 02:42:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:49,826 INFO L225 Difference]: With dead ends: 5452 [2018-12-09 02:42:49,826 INFO L226 Difference]: Without dead ends: 5452 [2018-12-09 02:42:49,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2018-12-09 02:42:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5053. [2018-12-09 02:42:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5053 states. [2018-12-09 02:42:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 11230 transitions. [2018-12-09 02:42:49,859 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 11230 transitions. Word has length 94 [2018-12-09 02:42:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:49,859 INFO L480 AbstractCegarLoop]: Abstraction has 5053 states and 11230 transitions. [2018-12-09 02:42:49,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 11230 transitions. [2018-12-09 02:42:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:42:49,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:49,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:49,863 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:49,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1981119559, now seen corresponding path program 1 times [2018-12-09 02:42:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:49,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:49,898 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:42:49,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:49,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:49,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:49,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:49,899 INFO L87 Difference]: Start difference. First operand 5053 states and 11230 transitions. Second operand 4 states. [2018-12-09 02:42:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:49,962 INFO L93 Difference]: Finished difference Result 6237 states and 13788 transitions. [2018-12-09 02:42:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:49,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 02:42:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:49,966 INFO L225 Difference]: With dead ends: 6237 [2018-12-09 02:42:49,966 INFO L226 Difference]: Without dead ends: 6237 [2018-12-09 02:42:49,967 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:42:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6237 states. [2018-12-09 02:42:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6237 to 5468. [2018-12-09 02:42:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-09 02:42:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12154 transitions. [2018-12-09 02:42:50,009 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12154 transitions. Word has length 94 [2018-12-09 02:42:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:50,009 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12154 transitions. [2018-12-09 02:42:50,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12154 transitions. [2018-12-09 02:42:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:50,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:50,013 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:42:50,013 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:50,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2018-12-09 02:42:50,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:50,043 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:42:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:50,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:50,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:50,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:50,044 INFO L87 Difference]: Start difference. First operand 5468 states and 12154 transitions. Second operand 5 states. [2018-12-09 02:42:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:50,106 INFO L93 Difference]: Finished difference Result 6369 states and 14143 transitions. [2018-12-09 02:42:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:50,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 02:42:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:50,110 INFO L225 Difference]: With dead ends: 6369 [2018-12-09 02:42:50,110 INFO L226 Difference]: Without dead ends: 6369 [2018-12-09 02:42:50,111 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:42:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2018-12-09 02:42:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 5007. [2018-12-09 02:42:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5007 states. [2018-12-09 02:42:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 11124 transitions. [2018-12-09 02:42:50,146 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 11124 transitions. Word has length 96 [2018-12-09 02:42:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:50,147 INFO L480 AbstractCegarLoop]: Abstraction has 5007 states and 11124 transitions. [2018-12-09 02:42:50,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 11124 transitions. [2018-12-09 02:42:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:50,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:50,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:50,150 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:50,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2018-12-09 02:42:50,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:50,218 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:42:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:50,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:50,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:50,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:50,219 INFO L87 Difference]: Start difference. First operand 5007 states and 11124 transitions. Second operand 7 states. [2018-12-09 02:42:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:50,412 INFO L93 Difference]: Finished difference Result 6705 states and 14747 transitions. [2018-12-09 02:42:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:50,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:42:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:50,416 INFO L225 Difference]: With dead ends: 6705 [2018-12-09 02:42:50,417 INFO L226 Difference]: Without dead ends: 6651 [2018-12-09 02:42:50,417 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:42:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6651 states. [2018-12-09 02:42:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6651 to 5484. [2018-12-09 02:42:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2018-12-09 02:42:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 12114 transitions. [2018-12-09 02:42:50,459 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 12114 transitions. Word has length 96 [2018-12-09 02:42:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:50,459 INFO L480 AbstractCegarLoop]: Abstraction has 5484 states and 12114 transitions. [2018-12-09 02:42:50,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 12114 transitions. [2018-12-09 02:42:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:50,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:50,462 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:42:50,463 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:50,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash -543358231, now seen corresponding path program 1 times [2018-12-09 02:42:50,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:50,517 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:42:50,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:50,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:50,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:50,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:50,518 INFO L87 Difference]: Start difference. First operand 5484 states and 12114 transitions. Second operand 6 states. [2018-12-09 02:42:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:50,713 INFO L93 Difference]: Finished difference Result 6419 states and 14264 transitions. [2018-12-09 02:42:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:50,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:42:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:50,717 INFO L225 Difference]: With dead ends: 6419 [2018-12-09 02:42:50,718 INFO L226 Difference]: Without dead ends: 6419 [2018-12-09 02:42:50,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2018-12-09 02:42:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 5689. [2018-12-09 02:42:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2018-12-09 02:42:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12563 transitions. [2018-12-09 02:42:50,756 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12563 transitions. Word has length 96 [2018-12-09 02:42:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:50,756 INFO L480 AbstractCegarLoop]: Abstraction has 5689 states and 12563 transitions. [2018-12-09 02:42:50,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12563 transitions. [2018-12-09 02:42:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:50,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:50,759 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:42:50,760 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:50,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2018-12-09 02:42:50,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:50,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:50,808 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:42:50,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:50,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:50,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:50,809 INFO L87 Difference]: Start difference. First operand 5689 states and 12563 transitions. Second operand 6 states. [2018-12-09 02:42:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:51,125 INFO L93 Difference]: Finished difference Result 7566 states and 16613 transitions. [2018-12-09 02:42:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:51,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:42:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:51,130 INFO L225 Difference]: With dead ends: 7566 [2018-12-09 02:42:51,131 INFO L226 Difference]: Without dead ends: 7550 [2018-12-09 02:42:51,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:42:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7550 states. [2018-12-09 02:42:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7550 to 6108. [2018-12-09 02:42:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2018-12-09 02:42:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 13598 transitions. [2018-12-09 02:42:51,179 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 13598 transitions. Word has length 96 [2018-12-09 02:42:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:51,179 INFO L480 AbstractCegarLoop]: Abstraction has 6108 states and 13598 transitions. [2018-12-09 02:42:51,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 13598 transitions. [2018-12-09 02:42:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:51,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:51,183 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:42:51,183 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:51,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2018-12-09 02:42:51,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:51,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:51,235 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:42:51,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:51,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:51,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:51,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:51,236 INFO L87 Difference]: Start difference. First operand 6108 states and 13598 transitions. Second operand 6 states. [2018-12-09 02:42:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:51,355 INFO L93 Difference]: Finished difference Result 6442 states and 14107 transitions. [2018-12-09 02:42:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:51,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:42:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:51,360 INFO L225 Difference]: With dead ends: 6442 [2018-12-09 02:42:51,360 INFO L226 Difference]: Without dead ends: 6420 [2018-12-09 02:42:51,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2018-12-09 02:42:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5492. [2018-12-09 02:42:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2018-12-09 02:42:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 12130 transitions. [2018-12-09 02:42:51,397 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 12130 transitions. Word has length 96 [2018-12-09 02:42:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 5492 states and 12130 transitions. [2018-12-09 02:42:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 12130 transitions. [2018-12-09 02:42:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:51,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:51,400 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:42:51,400 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2018-12-09 02:42:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:51,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:51,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:51,519 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:42:51,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:51,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:42:51,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:51,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:42:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:42:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:42:51,520 INFO L87 Difference]: Start difference. First operand 5492 states and 12130 transitions. Second operand 9 states. [2018-12-09 02:42:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:51,998 INFO L93 Difference]: Finished difference Result 6541 states and 14255 transitions. [2018-12-09 02:42:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:42:51,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 02:42:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:52,005 INFO L225 Difference]: With dead ends: 6541 [2018-12-09 02:42:52,006 INFO L226 Difference]: Without dead ends: 6541 [2018-12-09 02:42:52,006 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:42:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6541 states. [2018-12-09 02:42:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6541 to 5796. [2018-12-09 02:42:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5796 states. [2018-12-09 02:42:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 12754 transitions. [2018-12-09 02:42:52,053 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 12754 transitions. Word has length 96 [2018-12-09 02:42:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:52,053 INFO L480 AbstractCegarLoop]: Abstraction has 5796 states and 12754 transitions. [2018-12-09 02:42:52,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:42:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 12754 transitions. [2018-12-09 02:42:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:52,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:52,056 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:42:52,056 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:52,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2018-12-09 02:42:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:52,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:52,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:52,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:52,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:52,101 INFO L87 Difference]: Start difference. First operand 5796 states and 12754 transitions. Second operand 7 states. [2018-12-09 02:42:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:52,305 INFO L93 Difference]: Finished difference Result 7269 states and 15919 transitions. [2018-12-09 02:42:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:42:52,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:42:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:52,310 INFO L225 Difference]: With dead ends: 7269 [2018-12-09 02:42:52,310 INFO L226 Difference]: Without dead ends: 7269 [2018-12-09 02:42:52,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:42:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2018-12-09 02:42:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 6739. [2018-12-09 02:42:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6739 states. [2018-12-09 02:42:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 14734 transitions. [2018-12-09 02:42:52,356 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 14734 transitions. Word has length 96 [2018-12-09 02:42:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:52,356 INFO L480 AbstractCegarLoop]: Abstraction has 6739 states and 14734 transitions. [2018-12-09 02:42:52,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 14734 transitions. [2018-12-09 02:42:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:52,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:52,360 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:42:52,360 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:52,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2018-12-09 02:42:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:52,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:52,419 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:42:52,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:52,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:52,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:52,420 INFO L87 Difference]: Start difference. First operand 6739 states and 14734 transitions. Second operand 7 states. [2018-12-09 02:42:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:52,512 INFO L93 Difference]: Finished difference Result 8497 states and 18677 transitions. [2018-12-09 02:42:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:52,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 02:42:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:52,517 INFO L225 Difference]: With dead ends: 8497 [2018-12-09 02:42:52,517 INFO L226 Difference]: Without dead ends: 8497 [2018-12-09 02:42:52,518 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:42:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8497 states. [2018-12-09 02:42:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8497 to 6071. [2018-12-09 02:42:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6071 states. [2018-12-09 02:42:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13202 transitions. [2018-12-09 02:42:52,563 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13202 transitions. Word has length 96 [2018-12-09 02:42:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:52,563 INFO L480 AbstractCegarLoop]: Abstraction has 6071 states and 13202 transitions. [2018-12-09 02:42:52,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13202 transitions. [2018-12-09 02:42:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:52,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:52,567 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:42:52,567 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:52,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2018-12-09 02:42:52,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:52,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:52,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:52,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:52,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:52,639 INFO L87 Difference]: Start difference. First operand 6071 states and 13202 transitions. Second operand 5 states. [2018-12-09 02:42:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:52,663 INFO L93 Difference]: Finished difference Result 5991 states and 12954 transitions. [2018-12-09 02:42:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:52,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 02:42:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:52,667 INFO L225 Difference]: With dead ends: 5991 [2018-12-09 02:42:52,667 INFO L226 Difference]: Without dead ends: 5991 [2018-12-09 02:42:52,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-12-09 02:42:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4824. [2018-12-09 02:42:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2018-12-09 02:42:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 10480 transitions. [2018-12-09 02:42:52,704 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 10480 transitions. Word has length 96 [2018-12-09 02:42:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:52,704 INFO L480 AbstractCegarLoop]: Abstraction has 4824 states and 10480 transitions. [2018-12-09 02:42:52,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 10480 transitions. [2018-12-09 02:42:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:52,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:52,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:52,707 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:52,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2018-12-09 02:42:52,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:52,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:52,815 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:42:52,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:52,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 02:42:52,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:52,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:42:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:42:52,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:42:52,816 INFO L87 Difference]: Start difference. First operand 4824 states and 10480 transitions. Second operand 11 states. [2018-12-09 02:42:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:53,670 INFO L93 Difference]: Finished difference Result 8879 states and 19499 transitions. [2018-12-09 02:42:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:42:53,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 02:42:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:53,674 INFO L225 Difference]: With dead ends: 8879 [2018-12-09 02:42:53,674 INFO L226 Difference]: Without dead ends: 5533 [2018-12-09 02:42:53,675 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:42:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2018-12-09 02:42:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4236. [2018-12-09 02:42:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4236 states. [2018-12-09 02:42:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 9176 transitions. [2018-12-09 02:42:53,717 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 9176 transitions. Word has length 96 [2018-12-09 02:42:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:53,717 INFO L480 AbstractCegarLoop]: Abstraction has 4236 states and 9176 transitions. [2018-12-09 02:42:53,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:42:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 9176 transitions. [2018-12-09 02:42:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:42:53,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:53,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:53,721 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:53,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-09 02:42:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:53,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:53,770 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:42:53,842 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 02:42:53,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:42:53 BasicIcfg [2018-12-09 02:42:53,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:42:53,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:42:53,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:42:53,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:42:53,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:27" (3/4) ... [2018-12-09 02:42:53,845 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:42:53,922 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59579e60-28c0-496d-b86a-44dfd4ca19a6/bin-2019/utaipan/witness.graphml [2018-12-09 02:42:53,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:42:53,923 INFO L168 Benchmark]: Toolchain (without parser) took 26867.01 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,923 INFO L168 Benchmark]: CDTParser took 0.10 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:42:53,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.26 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.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,924 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 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:42:53,924 INFO L168 Benchmark]: RCFGBuilder took 324.72 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,924 INFO L168 Benchmark]: TraceAbstraction took 26061.35 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,924 INFO L168 Benchmark]: Witness Printer took 79.24 ms. Allocated memory is still 4.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:53,925 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.10 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 333.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.26 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.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.64 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 324.72 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26061.35 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 79.24 ms. Allocated memory is still 4.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t319; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t319, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t320; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t320, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 25.9s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9523 SDtfs, 10675 SDslu, 21495 SDs, 0 SdLazy, 9586 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 85 SyntacticMatches, 35 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 187726 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2611 NumberOfCodeBlocks, 2611 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 618750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...