./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/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 562269bef7a1d39f5f5cf32effa17ab983c170a5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46:48,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:46:48,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:46:48,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:46:48,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:46:48,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:46:48,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:46:48,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:46:48,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:46:48,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:46:48,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:46:48,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:46:48,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:46:48,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:46:48,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:46:48,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:46:48,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:46:48,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:46:48,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:46:48,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:46:48,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:46:48,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:46:48,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:46:48,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:46:48,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:46:48,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:46:48,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:46:48,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:46:48,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:46:48,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:46:48,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:46:48,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:46:48,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:46:48,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:46:48,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:46:48,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:46:48,532 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:46:48,540 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:46:48,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:46:48,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:46:48,540 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:46:48,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:46:48,541 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:46:48,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:46:48,542 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:46:48,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:46:48,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:46:48,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:46:48,544 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:46:48,544 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_37393ad8-76f0-4232-b282-79821d9d38c4/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 -> 562269bef7a1d39f5f5cf32effa17ab983c170a5 [2018-12-09 02:46:48,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:46:48,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:46:48,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:46:48,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:46:48,570 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:46:48,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i [2018-12-09 02:46:48,604 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/data/eece9572c/20f22bbb4365419d84b2f27c1f8dcfc8/FLAG13db8063f [2018-12-09 02:46:48,971 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:46:48,971 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i [2018-12-09 02:46:48,979 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/data/eece9572c/20f22bbb4365419d84b2f27c1f8dcfc8/FLAG13db8063f [2018-12-09 02:46:49,336 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/data/eece9572c/20f22bbb4365419d84b2f27c1f8dcfc8 [2018-12-09 02:46:49,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:46:49,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:46:49,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:46:49,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:46:49,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:46:49,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49, skipping insertion in model container [2018-12-09 02:46:49,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:46:49,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:46:49,571 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:46:49,579 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:46:49,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:46:49,717 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:46:49,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49 WrapperNode [2018-12-09 02:46:49,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:46:49,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:46:49,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:46:49,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:46:49,724 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:46:49" (1/1) ... [2018-12-09 02:46:49,734 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:46:49" (1/1) ... [2018-12-09 02:46:49,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:46:49,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:46:49,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:46:49,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:46:49,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... [2018-12-09 02:46:49,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:46:49,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:46:49,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:46:49,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:46:49,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/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:46:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 02:46:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 02:46:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 02:46:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 02:46:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:46:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:46:49,810 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:46:50,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:46:50,130 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:46:50,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:46:50 BoogieIcfgContainer [2018-12-09 02:46:50,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:46:50,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:46:50,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:46:50,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:46:50,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:46:49" (1/3) ... [2018-12-09 02:46:50,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a58b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:46:50, skipping insertion in model container [2018-12-09 02:46:50,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:46:49" (2/3) ... [2018-12-09 02:46:50,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a58b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:46:50, skipping insertion in model container [2018-12-09 02:46:50,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:46:50" (3/3) ... [2018-12-09 02:46:50,135 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt_false-unreach-call.i [2018-12-09 02:46:50,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,166 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,166 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,168 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,169 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,170 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,171 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:46:50,184 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 02:46:50,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:46:50,191 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 02:46:50,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 02:46:50,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:46:50,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:46:50,215 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:46:50,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:46:50,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:46:50,215 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:46:50,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:46:50,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:46:50,223 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 02:47:05,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 02:47:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 02:47:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 02:47:05,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:05,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:05,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:05,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 02:47:05,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:05,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:47:05,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:05,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:47:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:47:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:47:05,890 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 02:47:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:08,781 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 02:47:08,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:47:08,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 02:47:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:09,469 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 02:47:09,469 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 02:47:09,471 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:47:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 02:47:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 02:47:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 02:47:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 02:47:12,929 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 02:47:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:47:12,930 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 02:47:12,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:47:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 02:47:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 02:47:12,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:12,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:12,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:12,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 02:47:12,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:12,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:12,976 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:47:12,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:12,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:47:12,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:12,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:47:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:47:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:47:12,978 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 02:47:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:13,947 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 02:47:13,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:47:13,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 02:47:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:14,272 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 02:47:14,272 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 02:47:14,272 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:47:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 02:47:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 02:47:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 02:47:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 02:47:18,395 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 02:47:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:47:18,395 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 02:47:18,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:47:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 02:47:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 02:47:18,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:18,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:18,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:18,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 02:47:18,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:18,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:18,458 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:47:18,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:18,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:47:18,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:18,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:47:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:47:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:47:18,459 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 02:47:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:20,181 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 02:47:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:47:20,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 02:47:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:21,644 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 02:47:21,644 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 02:47:21,644 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:47:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 02:47:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 02:47:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 02:47:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 02:47:28,823 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 02:47:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:47:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 02:47:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:47:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 02:47:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 02:47:28,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:28,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:28,829 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:28,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:28,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 02:47:28,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:28,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:28,870 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:47:28,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:28,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:47:28,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:28,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:47:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:47:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:47:28,871 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-09 02:47:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:31,157 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-09 02:47:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:47:31,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 02:47:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:32,058 INFO L225 Difference]: With dead ends: 334052 [2018-12-09 02:47:32,058 INFO L226 Difference]: Without dead ends: 333002 [2018-12-09 02:47:32,058 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:47:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-09 02:47:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-09 02:47:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-09 02:47:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-09 02:47:39,870 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-09 02:47:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:47:39,871 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-09 02:47:39,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:47:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-09 02:47:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 02:47:39,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:39,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:39,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:39,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-09 02:47:39,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:39,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:39,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:47:39,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:39,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:47:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:47:39,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:47:39,946 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-09 02:47:40,300 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-12-09 02:47:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:42,264 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-09 02:47:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:47:42,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 02:47:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:43,725 INFO L225 Difference]: With dead ends: 342292 [2018-12-09 02:47:43,725 INFO L226 Difference]: Without dead ends: 341292 [2018-12-09 02:47:43,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:47:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-09 02:47:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-09 02:47:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-09 02:47:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-09 02:47:49,092 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-09 02:47:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:47:49,092 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-09 02:47:49,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:47:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-09 02:47:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:47:49,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:47:49,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:49,164 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:47:49,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-09 02:47:49,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:47:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:49,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:49,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:47:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:49,223 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:47:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:47:49,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:47:49,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:47:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:47:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:47:49,224 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-09 02:47:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:52,697 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-09 02:47:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:47:52,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 02:47:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:47:53,583 INFO L225 Difference]: With dead ends: 312432 [2018-12-09 02:47:53,583 INFO L226 Difference]: Without dead ends: 311792 [2018-12-09 02:47:53,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:47:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-09 02:47:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-09 02:47:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-09 02:48:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-09 02:48:00,125 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-09 02:48:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:00,125 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-09 02:48:00,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:48:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-09 02:48:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:48:00,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:00,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:00,241 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:00,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-09 02:48:00,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:00,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:00,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:48:00,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:48:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:48:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:48:00,317 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-09 02:48:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:04,017 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-09 02:48:04,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:48:04,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 02:48:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:09,835 INFO L225 Difference]: With dead ends: 617312 [2018-12-09 02:48:09,835 INFO L226 Difference]: Without dead ends: 615712 [2018-12-09 02:48:09,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:48:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-09 02:48:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-09 02:48:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-09 02:48:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-09 02:48:19,555 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-09 02:48:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:19,555 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-09 02:48:19,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:48:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-09 02:48:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:48:19,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:19,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:19,747 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:19,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-09 02:48:19,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:19,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:19,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:48:19,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:48:19,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:19,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:48:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:48:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:19,779 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-09 02:48:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:22,575 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-09 02:48:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:48:22,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 02:48:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:23,802 INFO L225 Difference]: With dead ends: 438907 [2018-12-09 02:48:23,802 INFO L226 Difference]: Without dead ends: 438907 [2018-12-09 02:48:23,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:48:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-09 02:48:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-09 02:48:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-09 02:48:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-09 02:48:35,700 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-09 02:48:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:35,700 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-09 02:48:35,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:48:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-09 02:48:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 02:48:35,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:35,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:35,965 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-09 02:48:35,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:35,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:48:36,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:48:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:48:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:48:36,027 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-09 02:48:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:48:40,776 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-09 02:48:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 02:48:40,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-09 02:48:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:48:43,212 INFO L225 Difference]: With dead ends: 675132 [2018-12-09 02:48:43,212 INFO L226 Difference]: Without dead ends: 673532 [2018-12-09 02:48:43,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-09 02:48:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-09 02:48:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-09 02:48:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-09 02:48:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-09 02:48:58,553 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-09 02:48:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:48:58,553 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-09 02:48:58,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:48:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-09 02:48:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 02:48:58,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:48:58,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:48:58,854 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:48:58,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:48:58,854 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-09 02:48:58,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:48:58,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:48:58,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:48:58,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:48:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:48:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:48:58,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:48:58,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:48:58,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:48:58,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:48:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:48:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:48:58,903 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 4 states. [2018-12-09 02:49:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:01,055 INFO L93 Difference]: Finished difference Result 340330 states and 1476149 transitions. [2018-12-09 02:49:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:01,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 02:49:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:01,962 INFO L225 Difference]: With dead ends: 340330 [2018-12-09 02:49:01,962 INFO L226 Difference]: Without dead ends: 337725 [2018-12-09 02:49:01,963 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:49:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337725 states. [2018-12-09 02:49:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337725 to 337725. [2018-12-09 02:49:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337725 states. [2018-12-09 02:49:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337725 states to 337725 states and 1467477 transitions. [2018-12-09 02:49:08,679 INFO L78 Accepts]: Start accepts. Automaton has 337725 states and 1467477 transitions. Word has length 72 [2018-12-09 02:49:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:08,679 INFO L480 AbstractCegarLoop]: Abstraction has 337725 states and 1467477 transitions. [2018-12-09 02:49:08,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 337725 states and 1467477 transitions. [2018-12-09 02:49:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:49:09,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:09,405 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:49:09,405 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:09,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -966195198, now seen corresponding path program 1 times [2018-12-09 02:49:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:09,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:09,435 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:49:09,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:09,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:09,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:09,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:09,436 INFO L87 Difference]: Start difference. First operand 337725 states and 1467477 transitions. Second operand 5 states. [2018-12-09 02:49:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:09,976 INFO L93 Difference]: Finished difference Result 123261 states and 489737 transitions. [2018-12-09 02:49:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:49:09,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 02:49:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:10,248 INFO L225 Difference]: With dead ends: 123261 [2018-12-09 02:49:10,248 INFO L226 Difference]: Without dead ends: 120949 [2018-12-09 02:49:10,248 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:49:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120949 states. [2018-12-09 02:49:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120949 to 120949. [2018-12-09 02:49:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120949 states. [2018-12-09 02:49:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120949 states to 120949 states and 481083 transitions. [2018-12-09 02:49:15,014 INFO L78 Accepts]: Start accepts. Automaton has 120949 states and 481083 transitions. Word has length 73 [2018-12-09 02:49:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 120949 states and 481083 transitions. [2018-12-09 02:49:15,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 120949 states and 481083 transitions. [2018-12-09 02:49:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 02:49:15,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,097 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] [2018-12-09 02:49:15,097 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:15,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1713809945, now seen corresponding path program 1 times [2018-12-09 02:49:15,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:15,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,151 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:49:15,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:15,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:15,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:49:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:49:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:15,153 INFO L87 Difference]: Start difference. First operand 120949 states and 481083 transitions. Second operand 4 states. [2018-12-09 02:49:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:16,055 INFO L93 Difference]: Finished difference Result 151209 states and 596504 transitions. [2018-12-09 02:49:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:16,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 02:49:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:16,376 INFO L225 Difference]: With dead ends: 151209 [2018-12-09 02:49:16,376 INFO L226 Difference]: Without dead ends: 151209 [2018-12-09 02:49:16,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151209 states. [2018-12-09 02:49:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151209 to 126025. [2018-12-09 02:49:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126025 states. [2018-12-09 02:49:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126025 states to 126025 states and 499976 transitions. [2018-12-09 02:49:18,661 INFO L78 Accepts]: Start accepts. Automaton has 126025 states and 499976 transitions. Word has length 79 [2018-12-09 02:49:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:18,661 INFO L480 AbstractCegarLoop]: Abstraction has 126025 states and 499976 transitions. [2018-12-09 02:49:18,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 126025 states and 499976 transitions. [2018-12-09 02:49:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 02:49:18,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:18,746 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] [2018-12-09 02:49:18,746 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:18,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash 543101062, now seen corresponding path program 1 times [2018-12-09 02:49:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:18,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:18,805 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:49:18,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:18,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:18,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:18,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:18,806 INFO L87 Difference]: Start difference. First operand 126025 states and 499976 transitions. Second operand 6 states. [2018-12-09 02:49:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:18,877 INFO L93 Difference]: Finished difference Result 18937 states and 65328 transitions. [2018-12-09 02:49:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:18,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 02:49:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:18,901 INFO L225 Difference]: With dead ends: 18937 [2018-12-09 02:49:18,901 INFO L226 Difference]: Without dead ends: 17225 [2018-12-09 02:49:18,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:49:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17225 states. [2018-12-09 02:49:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17225 to 16710. [2018-12-09 02:49:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2018-12-09 02:49:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 57632 transitions. [2018-12-09 02:49:19,083 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 57632 transitions. Word has length 79 [2018-12-09 02:49:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:19,083 INFO L480 AbstractCegarLoop]: Abstraction has 16710 states and 57632 transitions. [2018-12-09 02:49:19,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 57632 transitions. [2018-12-09 02:49:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 02:49:19,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:19,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:19,100 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:19,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-09 02:49:19,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:19,125 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:49:19,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:19,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:49:19,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:19,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:19,126 INFO L87 Difference]: Start difference. First operand 16710 states and 57632 transitions. Second operand 3 states. [2018-12-09 02:49:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:19,232 INFO L93 Difference]: Finished difference Result 17130 states and 58913 transitions. [2018-12-09 02:49:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:19,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 02:49:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:19,254 INFO L225 Difference]: With dead ends: 17130 [2018-12-09 02:49:19,254 INFO L226 Difference]: Without dead ends: 17130 [2018-12-09 02:49:19,254 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:49:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2018-12-09 02:49:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16900. [2018-12-09 02:49:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16900 states. [2018-12-09 02:49:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16900 states to 16900 states and 58214 transitions. [2018-12-09 02:49:19,435 INFO L78 Accepts]: Start accepts. Automaton has 16900 states and 58214 transitions. Word has length 98 [2018-12-09 02:49:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:19,435 INFO L480 AbstractCegarLoop]: Abstraction has 16900 states and 58214 transitions. [2018-12-09 02:49:19,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16900 states and 58214 transitions. [2018-12-09 02:49:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 02:49:19,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:19,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:19,451 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:19,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2037064255, now seen corresponding path program 1 times [2018-12-09 02:49:19,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:19,505 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:49:19,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:19,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:19,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:19,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:19,506 INFO L87 Difference]: Start difference. First operand 16900 states and 58214 transitions. Second operand 5 states. [2018-12-09 02:49:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:19,661 INFO L93 Difference]: Finished difference Result 19045 states and 64930 transitions. [2018-12-09 02:49:19,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:19,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 02:49:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:19,685 INFO L225 Difference]: With dead ends: 19045 [2018-12-09 02:49:19,685 INFO L226 Difference]: Without dead ends: 19045 [2018-12-09 02:49:19,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19045 states. [2018-12-09 02:49:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19045 to 18841. [2018-12-09 02:49:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-09 02:49:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 64330 transitions. [2018-12-09 02:49:19,981 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 64330 transitions. Word has length 98 [2018-12-09 02:49:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:19,982 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 64330 transitions. [2018-12-09 02:49:19,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 64330 transitions. [2018-12-09 02:49:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 02:49:19,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:19,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:19,997 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:19,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2029304896, now seen corresponding path program 2 times [2018-12-09 02:49:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:19,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:20,037 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:49:20,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:20,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:20,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:20,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:49:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:49:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:20,038 INFO L87 Difference]: Start difference. First operand 18841 states and 64330 transitions. Second operand 4 states. [2018-12-09 02:49:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:20,228 INFO L93 Difference]: Finished difference Result 25585 states and 87647 transitions. [2018-12-09 02:49:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:49:20,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 02:49:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:20,263 INFO L225 Difference]: With dead ends: 25585 [2018-12-09 02:49:20,263 INFO L226 Difference]: Without dead ends: 25585 [2018-12-09 02:49:20,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25585 states. [2018-12-09 02:49:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25585 to 19051. [2018-12-09 02:49:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19051 states. [2018-12-09 02:49:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19051 states to 19051 states and 64968 transitions. [2018-12-09 02:49:20,501 INFO L78 Accepts]: Start accepts. Automaton has 19051 states and 64968 transitions. Word has length 98 [2018-12-09 02:49:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:20,501 INFO L480 AbstractCegarLoop]: Abstraction has 19051 states and 64968 transitions. [2018-12-09 02:49:20,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19051 states and 64968 transitions. [2018-12-09 02:49:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:20,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:20,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:20,518 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:20,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-09 02:49:20,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:20,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:20,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:20,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:20,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:20,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:20,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:49:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:49:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:20,555 INFO L87 Difference]: Start difference. First operand 19051 states and 64968 transitions. Second operand 4 states. [2018-12-09 02:49:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:20,704 INFO L93 Difference]: Finished difference Result 33609 states and 114566 transitions. [2018-12-09 02:49:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:49:20,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 02:49:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:20,750 INFO L225 Difference]: With dead ends: 33609 [2018-12-09 02:49:20,750 INFO L226 Difference]: Without dead ends: 33609 [2018-12-09 02:49:20,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33609 states. [2018-12-09 02:49:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33609 to 18801. [2018-12-09 02:49:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18801 states. [2018-12-09 02:49:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18801 states to 18801 states and 63833 transitions. [2018-12-09 02:49:21,022 INFO L78 Accepts]: Start accepts. Automaton has 18801 states and 63833 transitions. Word has length 100 [2018-12-09 02:49:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,022 INFO L480 AbstractCegarLoop]: Abstraction has 18801 states and 63833 transitions. [2018-12-09 02:49:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18801 states and 63833 transitions. [2018-12-09 02:49:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:21,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:21,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:21,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:21,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:21,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2017356457, now seen corresponding path program 1 times [2018-12-09 02:49:21,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:21,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:21,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:21,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:21,089 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:49:21,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:21,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:21,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:21,090 INFO L87 Difference]: Start difference. First operand 18801 states and 63833 transitions. Second operand 6 states. [2018-12-09 02:49:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:21,309 INFO L93 Difference]: Finished difference Result 20861 states and 70246 transitions. [2018-12-09 02:49:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:49:21,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 02:49:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:21,334 INFO L225 Difference]: With dead ends: 20861 [2018-12-09 02:49:21,334 INFO L226 Difference]: Without dead ends: 20861 [2018-12-09 02:49:21,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20861 states. [2018-12-09 02:49:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20861 to 19146. [2018-12-09 02:49:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19146 states. [2018-12-09 02:49:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19146 states to 19146 states and 64944 transitions. [2018-12-09 02:49:21,542 INFO L78 Accepts]: Start accepts. Automaton has 19146 states and 64944 transitions. Word has length 100 [2018-12-09 02:49:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,543 INFO L480 AbstractCegarLoop]: Abstraction has 19146 states and 64944 transitions. [2018-12-09 02:49:21,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 19146 states and 64944 transitions. [2018-12-09 02:49:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:21,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:21,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:21,560 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:21,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1047775434, now seen corresponding path program 1 times [2018-12-09 02:49:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:21,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:21,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:21,617 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:49:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:21,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:21,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:21,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:21,618 INFO L87 Difference]: Start difference. First operand 19146 states and 64944 transitions. Second operand 6 states. [2018-12-09 02:49:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:21,755 INFO L93 Difference]: Finished difference Result 18425 states and 62209 transitions. [2018-12-09 02:49:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:21,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 02:49:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:21,777 INFO L225 Difference]: With dead ends: 18425 [2018-12-09 02:49:21,777 INFO L226 Difference]: Without dead ends: 18425 [2018-12-09 02:49:21,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18425 states. [2018-12-09 02:49:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18425 to 18076. [2018-12-09 02:49:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18076 states. [2018-12-09 02:49:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18076 states to 18076 states and 61188 transitions. [2018-12-09 02:49:21,992 INFO L78 Accepts]: Start accepts. Automaton has 18076 states and 61188 transitions. Word has length 100 [2018-12-09 02:49:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,992 INFO L480 AbstractCegarLoop]: Abstraction has 18076 states and 61188 transitions. [2018-12-09 02:49:21,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18076 states and 61188 transitions. [2018-12-09 02:49:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:22,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:22,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:22,009 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:22,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1452574727, now seen corresponding path program 1 times [2018-12-09 02:49:22,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:22,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:22,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:22,055 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:49:22,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:22,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:22,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:22,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:22,056 INFO L87 Difference]: Start difference. First operand 18076 states and 61188 transitions. Second operand 6 states. [2018-12-09 02:49:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:22,293 INFO L93 Difference]: Finished difference Result 19651 states and 65448 transitions. [2018-12-09 02:49:22,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:22,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 02:49:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:22,316 INFO L225 Difference]: With dead ends: 19651 [2018-12-09 02:49:22,316 INFO L226 Difference]: Without dead ends: 19101 [2018-12-09 02:49:22,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19101 states. [2018-12-09 02:49:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19101 to 18526. [2018-12-09 02:49:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18526 states. [2018-12-09 02:49:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 62353 transitions. [2018-12-09 02:49:22,512 INFO L78 Accepts]: Start accepts. Automaton has 18526 states and 62353 transitions. Word has length 100 [2018-12-09 02:49:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:22,512 INFO L480 AbstractCegarLoop]: Abstraction has 18526 states and 62353 transitions. [2018-12-09 02:49:22,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 18526 states and 62353 transitions. [2018-12-09 02:49:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:22,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:22,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:22,530 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:22,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash 248165752, now seen corresponding path program 1 times [2018-12-09 02:49:22,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:22,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:22,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:22,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:22,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:22,587 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:49:22,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:22,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:22,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:22,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:22,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:22,588 INFO L87 Difference]: Start difference. First operand 18526 states and 62353 transitions. Second operand 7 states. [2018-12-09 02:49:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:22,853 INFO L93 Difference]: Finished difference Result 19479 states and 65421 transitions. [2018-12-09 02:49:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:22,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 02:49:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:22,876 INFO L225 Difference]: With dead ends: 19479 [2018-12-09 02:49:22,876 INFO L226 Difference]: Without dead ends: 19479 [2018-12-09 02:49:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19479 states. [2018-12-09 02:49:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19479 to 18431. [2018-12-09 02:49:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18431 states. [2018-12-09 02:49:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18431 states to 18431 states and 62077 transitions. [2018-12-09 02:49:23,074 INFO L78 Accepts]: Start accepts. Automaton has 18431 states and 62077 transitions. Word has length 100 [2018-12-09 02:49:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:23,074 INFO L480 AbstractCegarLoop]: Abstraction has 18431 states and 62077 transitions. [2018-12-09 02:49:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 18431 states and 62077 transitions. [2018-12-09 02:49:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:23,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:23,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:23,092 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:23,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1659045272, now seen corresponding path program 1 times [2018-12-09 02:49:23,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:23,153 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:49:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:23,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:23,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:23,154 INFO L87 Difference]: Start difference. First operand 18431 states and 62077 transitions. Second operand 5 states. [2018-12-09 02:49:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:23,262 INFO L93 Difference]: Finished difference Result 17087 states and 57629 transitions. [2018-12-09 02:49:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:49:23,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 02:49:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:23,284 INFO L225 Difference]: With dead ends: 17087 [2018-12-09 02:49:23,284 INFO L226 Difference]: Without dead ends: 17087 [2018-12-09 02:49:23,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17087 states. [2018-12-09 02:49:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17087 to 16902. [2018-12-09 02:49:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2018-12-09 02:49:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 57111 transitions. [2018-12-09 02:49:23,457 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 57111 transitions. Word has length 100 [2018-12-09 02:49:23,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:23,457 INFO L480 AbstractCegarLoop]: Abstraction has 16902 states and 57111 transitions. [2018-12-09 02:49:23,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 57111 transitions. [2018-12-09 02:49:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 02:49:23,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:23,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:23,471 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:23,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash -127158119, now seen corresponding path program 1 times [2018-12-09 02:49:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:23,539 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:49:23,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:23,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:23,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:23,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:23,540 INFO L87 Difference]: Start difference. First operand 16902 states and 57111 transitions. Second operand 6 states. [2018-12-09 02:49:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:23,666 INFO L93 Difference]: Finished difference Result 10950 states and 35655 transitions. [2018-12-09 02:49:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:49:23,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 02:49:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:23,677 INFO L225 Difference]: With dead ends: 10950 [2018-12-09 02:49:23,678 INFO L226 Difference]: Without dead ends: 10950 [2018-12-09 02:49:23,678 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:49:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2018-12-09 02:49:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 9461. [2018-12-09 02:49:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2018-12-09 02:49:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 31041 transitions. [2018-12-09 02:49:23,776 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 31041 transitions. Word has length 100 [2018-12-09 02:49:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:23,776 INFO L480 AbstractCegarLoop]: Abstraction has 9461 states and 31041 transitions. [2018-12-09 02:49:23,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 31041 transitions. [2018-12-09 02:49:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:23,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:23,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:23,784 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:23,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 02:49:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:23,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:23,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:23,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:23,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:23,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:23,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:23,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:23,824 INFO L87 Difference]: Start difference. First operand 9461 states and 31041 transitions. Second operand 7 states. [2018-12-09 02:49:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:24,163 INFO L93 Difference]: Finished difference Result 17675 states and 57162 transitions. [2018-12-09 02:49:24,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:49:24,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 02:49:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:24,181 INFO L225 Difference]: With dead ends: 17675 [2018-12-09 02:49:24,181 INFO L226 Difference]: Without dead ends: 17547 [2018-12-09 02:49:24,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:49:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17547 states. [2018-12-09 02:49:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17547 to 13761. [2018-12-09 02:49:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-09 02:49:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45029 transitions. [2018-12-09 02:49:24,340 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45029 transitions. Word has length 102 [2018-12-09 02:49:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:24,340 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45029 transitions. [2018-12-09 02:49:24,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45029 transitions. [2018-12-09 02:49:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:24,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:24,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:24,353 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:24,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 02:49:24,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:24,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:24,406 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:49:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:24,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:24,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:24,407 INFO L87 Difference]: Start difference. First operand 13761 states and 45029 transitions. Second operand 6 states. [2018-12-09 02:49:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:24,527 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-09 02:49:24,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:24,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 02:49:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:24,543 INFO L225 Difference]: With dead ends: 14001 [2018-12-09 02:49:24,543 INFO L226 Difference]: Without dead ends: 14001 [2018-12-09 02:49:24,543 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:49:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-09 02:49:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-09 02:49:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-09 02:49:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-09 02:49:24,683 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-09 02:49:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:24,683 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-09 02:49:24,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-09 02:49:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:24,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:24,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:24,695 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:24,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 02:49:24,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:24,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:24,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:24,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:24,756 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:49:24,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:24,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:24,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:24,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:24,757 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-09 02:49:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:24,951 INFO L93 Difference]: Finished difference Result 15970 states and 51436 transitions. [2018-12-09 02:49:24,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:24,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 02:49:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:24,969 INFO L225 Difference]: With dead ends: 15970 [2018-12-09 02:49:24,969 INFO L226 Difference]: Without dead ends: 15970 [2018-12-09 02:49:24,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15970 states. [2018-12-09 02:49:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15970 to 13806. [2018-12-09 02:49:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2018-12-09 02:49:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 44760 transitions. [2018-12-09 02:49:25,114 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 44760 transitions. Word has length 102 [2018-12-09 02:49:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:25,114 INFO L480 AbstractCegarLoop]: Abstraction has 13806 states and 44760 transitions. [2018-12-09 02:49:25,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 44760 transitions. [2018-12-09 02:49:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:25,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:25,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:25,126 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:25,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2093366609, now seen corresponding path program 1 times [2018-12-09 02:49:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:25,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:25,167 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:49:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:25,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:25,168 INFO L87 Difference]: Start difference. First operand 13806 states and 44760 transitions. Second operand 5 states. [2018-12-09 02:49:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:25,309 INFO L93 Difference]: Finished difference Result 15598 states and 50520 transitions. [2018-12-09 02:49:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:25,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 02:49:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:25,327 INFO L225 Difference]: With dead ends: 15598 [2018-12-09 02:49:25,327 INFO L226 Difference]: Without dead ends: 15470 [2018-12-09 02:49:25,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2018-12-09 02:49:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 11520. [2018-12-09 02:49:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11520 states. [2018-12-09 02:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 37527 transitions. [2018-12-09 02:49:25,455 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 37527 transitions. Word has length 102 [2018-12-09 02:49:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:25,455 INFO L480 AbstractCegarLoop]: Abstraction has 11520 states and 37527 transitions. [2018-12-09 02:49:25,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 37527 transitions. [2018-12-09 02:49:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:25,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:25,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:25,464 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:25,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:25,464 INFO L82 PathProgramCache]: Analyzing trace with hash -848602128, now seen corresponding path program 1 times [2018-12-09 02:49:25,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:25,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:25,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:25,565 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:49:25,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:25,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 02:49:25,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:25,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 02:49:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 02:49:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:49:25,566 INFO L87 Difference]: Start difference. First operand 11520 states and 37527 transitions. Second operand 10 states. [2018-12-09 02:49:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:25,880 INFO L93 Difference]: Finished difference Result 21916 states and 71836 transitions. [2018-12-09 02:49:25,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:25,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 02:49:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:25,892 INFO L225 Difference]: With dead ends: 21916 [2018-12-09 02:49:25,893 INFO L226 Difference]: Without dead ends: 10860 [2018-12-09 02:49:25,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 02:49:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2018-12-09 02:49:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10860. [2018-12-09 02:49:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10860 states. [2018-12-09 02:49:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 35591 transitions. [2018-12-09 02:49:25,998 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 35591 transitions. Word has length 102 [2018-12-09 02:49:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:25,998 INFO L480 AbstractCegarLoop]: Abstraction has 10860 states and 35591 transitions. [2018-12-09 02:49:25,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 02:49:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 35591 transitions. [2018-12-09 02:49:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:26,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:26,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:26,011 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:26,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1501379030, now seen corresponding path program 2 times [2018-12-09 02:49:26,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:26,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:26,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:26,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:26,079 INFO L87 Difference]: Start difference. First operand 10860 states and 35591 transitions. Second operand 7 states. [2018-12-09 02:49:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:26,302 INFO L93 Difference]: Finished difference Result 18110 states and 60250 transitions. [2018-12-09 02:49:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:26,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 02:49:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:26,311 INFO L225 Difference]: With dead ends: 18110 [2018-12-09 02:49:26,311 INFO L226 Difference]: Without dead ends: 7461 [2018-12-09 02:49:26,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:49:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-09 02:49:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-09 02:49:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-09 02:49:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25211 transitions. [2018-12-09 02:49:26,388 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25211 transitions. Word has length 102 [2018-12-09 02:49:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:26,388 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25211 transitions. [2018-12-09 02:49:26,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25211 transitions. [2018-12-09 02:49:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:26,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:26,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,395 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:26,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-09 02:49:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:26,470 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:49:26,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:26,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:26,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:26,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:26,470 INFO L87 Difference]: Start difference. First operand 7461 states and 25211 transitions. Second operand 7 states. [2018-12-09 02:49:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:26,720 INFO L93 Difference]: Finished difference Result 9597 states and 31665 transitions. [2018-12-09 02:49:26,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:49:26,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 02:49:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:26,730 INFO L225 Difference]: With dead ends: 9597 [2018-12-09 02:49:26,730 INFO L226 Difference]: Without dead ends: 9461 [2018-12-09 02:49:26,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:49:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2018-12-09 02:49:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 7445. [2018-12-09 02:49:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2018-12-09 02:49:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 25119 transitions. [2018-12-09 02:49:26,811 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 25119 transitions. Word has length 102 [2018-12-09 02:49:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:26,811 INFO L480 AbstractCegarLoop]: Abstraction has 7445 states and 25119 transitions. [2018-12-09 02:49:26,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 25119 transitions. [2018-12-09 02:49:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:26,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:26,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,817 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-09 02:49:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:26,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:26,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:26,901 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:49:26,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:26,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:26,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:26,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:26,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:26,902 INFO L87 Difference]: Start difference. First operand 7445 states and 25119 transitions. Second operand 7 states. [2018-12-09 02:49:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:27,068 INFO L93 Difference]: Finished difference Result 14873 states and 50598 transitions. [2018-12-09 02:49:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:27,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 02:49:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:27,087 INFO L225 Difference]: With dead ends: 14873 [2018-12-09 02:49:27,087 INFO L226 Difference]: Without dead ends: 14873 [2018-12-09 02:49:27,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:49:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14873 states. [2018-12-09 02:49:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14873 to 7605. [2018-12-09 02:49:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7605 states. [2018-12-09 02:49:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7605 states to 7605 states and 25535 transitions. [2018-12-09 02:49:27,198 INFO L78 Accepts]: Start accepts. Automaton has 7605 states and 25535 transitions. Word has length 102 [2018-12-09 02:49:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:27,199 INFO L480 AbstractCegarLoop]: Abstraction has 7605 states and 25535 transitions. [2018-12-09 02:49:27,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7605 states and 25535 transitions. [2018-12-09 02:49:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:27,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:27,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:27,205 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:27,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-09 02:49:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:27,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:27,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:27,299 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:49:27,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:27,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 02:49:27,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:27,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 02:49:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 02:49:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:49:27,299 INFO L87 Difference]: Start difference. First operand 7605 states and 25535 transitions. Second operand 12 states. [2018-12-09 02:49:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:27,619 INFO L93 Difference]: Finished difference Result 14809 states and 49866 transitions. [2018-12-09 02:49:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 02:49:27,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 02:49:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:27,630 INFO L225 Difference]: With dead ends: 14809 [2018-12-09 02:49:27,630 INFO L226 Difference]: Without dead ends: 10265 [2018-12-09 02:49:27,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 02:49:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2018-12-09 02:49:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 9657. [2018-12-09 02:49:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9657 states. [2018-12-09 02:49:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 31706 transitions. [2018-12-09 02:49:27,729 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 31706 transitions. Word has length 102 [2018-12-09 02:49:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 9657 states and 31706 transitions. [2018-12-09 02:49:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 02:49:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 31706 transitions. [2018-12-09 02:49:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 02:49:27,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,737 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:27,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:27,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-09 02:49:27,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:27,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:27,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:27,784 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:49:27,874 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 02:49:27,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:49:27 BasicIcfg [2018-12-09 02:49:27,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:49:27,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:49:27,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:49:27,876 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:49:27,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:46:50" (3/4) ... [2018-12-09 02:49:27,878 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:49:27,957 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_37393ad8-76f0-4232-b282-79821d9d38c4/bin-2019/utaipan/witness.graphml [2018-12-09 02:49:27,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:49:27,958 INFO L168 Benchmark]: Toolchain (without parser) took 158619.76 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 944.8 MB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,958 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: Boogie Preprocessor took 21.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: RCFGBuilder took 355.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: TraceAbstraction took 157745.10 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,959 INFO L168 Benchmark]: Witness Printer took 81.70 ms. Allocated memory is still 8.9 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:27,961 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 355.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157745.10 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 81.70 ms. Allocated memory is still 8.9 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1500; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1501; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1502; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 157.6s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 49.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7941 SDtfs, 8288 SDslu, 19267 SDs, 0 SdLazy, 6661 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 97 SyntacticMatches, 18 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385502occurred in iteration=9, 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: 88.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 1212228 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2837 NumberOfCodeBlocks, 2837 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2703 ConstructedInterpolants, 0 QuantifiedInterpolants, 561956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...