./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_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_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/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 7fedffaf166c04fa23911a87ebd562034522f75b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:43:52,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:43:52,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:43:52,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:43:52,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:43:52,491 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:43:52,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:43:52,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:43:52,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:43:52,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:43:52,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:43:52,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:43:52,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:43:52,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:43:52,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:43:52,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:43:52,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:43:52,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:43:52,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:43:52,499 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:43:52,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:43:52,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:43:52,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:43:52,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:43:52,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:43:52,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:43:52,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:43:52,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:43:52,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:43:52,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:43:52,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:43:52,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:43:52,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:43:52,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:43:52,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:43:52,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:43:52,505 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:43:52,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:43:52,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:43:52,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:43:52,513 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:43:52,514 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:43:52,514 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:43:52,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:43:52,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:43:52,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:43:52,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:43:52,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:43:52,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:43:52,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:43:52,517 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_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/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 -> 7fedffaf166c04fa23911a87ebd562034522f75b [2018-12-02 23:43:52,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:43:52,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:43:52,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:43:52,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:43:52,548 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:43:52,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2018-12-02 23:43:52,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/data/6619927ee/8136417115a94e2c90c57281a4d77626/FLAGc819961dc [2018-12-02 23:43:52,948 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:43:52,949 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/sv-benchmarks/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2018-12-02 23:43:52,957 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/data/6619927ee/8136417115a94e2c90c57281a4d77626/FLAGc819961dc [2018-12-02 23:43:53,334 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/data/6619927ee/8136417115a94e2c90c57281a4d77626 [2018-12-02 23:43:53,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:43:53,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:43:53,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:43:53,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:43:53,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:43:53,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53, skipping insertion in model container [2018-12-02 23:43:53,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:43:53,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:43:53,556 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:43:53,563 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:43:53,636 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:43:53,666 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:43:53,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53 WrapperNode [2018-12-02 23:43:53,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:43:53,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:43:53,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:43:53,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:43:53,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:43:53,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:43:53,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:43:53,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:43:53,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... [2018-12-02 23:43:53,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:43:53,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:43:53,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:43:53,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:43:53,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:43:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:43:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 23:43:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 23:43:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 23:43:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:43:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:43:53,753 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 23:43:54,061 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:43:54,061 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 23:43:54,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:54 BoogieIcfgContainer [2018-12-02 23:43:54,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:43:54,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:43:54,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:43:54,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:43:54,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:43:53" (1/3) ... [2018-12-02 23:43:54,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea2b5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:43:54, skipping insertion in model container [2018-12-02 23:43:54,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:53" (2/3) ... [2018-12-02 23:43:54,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea2b5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:43:54, skipping insertion in model container [2018-12-02 23:43:54,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:54" (3/3) ... [2018-12-02 23:43:54,065 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt_false-unreach-call.i [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:43:54,096 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:43:54,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:43:54,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 23:43:54,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 23:43:54,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:43:54,124 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:43:54,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:43:54,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:43:54,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:43:54,125 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:43:54,125 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:43:54,125 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:43:54,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 23:43:55,249 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2018-12-02 23:43:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2018-12-02 23:43:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 23:43:55,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:55,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:43:55,257 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:55,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2018-12-02 23:43:55,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:55,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:55,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:55,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:43:55,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:55,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:43:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:43:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:43:55,407 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2018-12-02 23:43:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:43:55,762 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2018-12-02 23:43:55,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:43:55,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 23:43:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:43:55,914 INFO L225 Difference]: With dead ends: 45388 [2018-12-02 23:43:55,914 INFO L226 Difference]: Without dead ends: 40628 [2018-12-02 23:43:55,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:43:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2018-12-02 23:43:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2018-12-02 23:43:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2018-12-02 23:43:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2018-12-02 23:43:56,615 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2018-12-02 23:43:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:43:56,615 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2018-12-02 23:43:56,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:43:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2018-12-02 23:43:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 23:43:56,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:56,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:43:56,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:56,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2018-12-02 23:43:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:56,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:56,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:43:56,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:56,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:43:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:43:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:43:56,687 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2018-12-02 23:43:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:43:57,351 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2018-12-02 23:43:57,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:43:57,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 23:43:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:43:57,517 INFO L225 Difference]: With dead ends: 64830 [2018-12-02 23:43:57,517 INFO L226 Difference]: Without dead ends: 64670 [2018-12-02 23:43:57,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:43:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2018-12-02 23:43:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2018-12-02 23:43:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2018-12-02 23:43:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2018-12-02 23:43:58,277 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2018-12-02 23:43:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:43:58,278 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2018-12-02 23:43:58,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:43:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2018-12-02 23:43:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 23:43:58,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:58,282 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] [2018-12-02 23:43:58,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:58,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2018-12-02 23:43:58,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:43:58,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:58,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:43:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:43:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:43:58,323 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2018-12-02 23:43:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:43:58,371 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2018-12-02 23:43:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:43:58,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 23:43:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:43:58,387 INFO L225 Difference]: With dead ends: 12364 [2018-12-02 23:43:58,387 INFO L226 Difference]: Without dead ends: 11843 [2018-12-02 23:43:58,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:43:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2018-12-02 23:43:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2018-12-02 23:43:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2018-12-02 23:43:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2018-12-02 23:43:58,512 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2018-12-02 23:43:58,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:43:58,513 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2018-12-02 23:43:58,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:43:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2018-12-02 23:43:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 23:43:58,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:58,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:43:58,516 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:58,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -372868821, now seen corresponding path program 1 times [2018-12-02 23:43:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:58,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:58,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:43:58,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:58,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:43:58,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:43:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:43:58,568 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2018-12-02 23:43:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:43:58,728 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2018-12-02 23:43:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:43:58,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 23:43:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:43:58,753 INFO L225 Difference]: With dead ends: 17019 [2018-12-02 23:43:58,753 INFO L226 Difference]: Without dead ends: 17019 [2018-12-02 23:43:58,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:43:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2018-12-02 23:43:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2018-12-02 23:43:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2018-12-02 23:43:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2018-12-02 23:43:58,946 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2018-12-02 23:43:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:43:58,947 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2018-12-02 23:43:58,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:43:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2018-12-02 23:43:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 23:43:58,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:58,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:43:58,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:58,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1400961321, now seen corresponding path program 1 times [2018-12-02 23:43:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:58,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:43:59,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:43:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:43:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:43:59,026 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2018-12-02 23:43:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:43:59,431 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2018-12-02 23:43:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:43:59,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 23:43:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:43:59,458 INFO L225 Difference]: With dead ends: 18599 [2018-12-02 23:43:59,458 INFO L226 Difference]: Without dead ends: 18567 [2018-12-02 23:43:59,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:43:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2018-12-02 23:43:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2018-12-02 23:43:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2018-12-02 23:43:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2018-12-02 23:43:59,683 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2018-12-02 23:43:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:43:59,684 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2018-12-02 23:43:59,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:43:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2018-12-02 23:43:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:43:59,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:43:59,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:43:59,694 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:43:59,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:43:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1996508936, now seen corresponding path program 1 times [2018-12-02 23:43:59,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:43:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:43:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:43:59,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:43:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:43:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:43:59,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:43:59,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:43:59,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:43:59,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:43:59,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:43:59,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:43:59,730 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 4 states. [2018-12-02 23:44:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:00,018 INFO L93 Difference]: Finished difference Result 23159 states and 75002 transitions. [2018-12-02 23:44:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:44:00,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 23:44:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:00,045 INFO L225 Difference]: With dead ends: 23159 [2018-12-02 23:44:00,045 INFO L226 Difference]: Without dead ends: 22983 [2018-12-02 23:44:00,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22983 states. [2018-12-02 23:44:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22983 to 19511. [2018-12-02 23:44:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19511 states. [2018-12-02 23:44:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19511 states to 19511 states and 63974 transitions. [2018-12-02 23:44:00,280 INFO L78 Accepts]: Start accepts. Automaton has 19511 states and 63974 transitions. Word has length 72 [2018-12-02 23:44:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:00,281 INFO L480 AbstractCegarLoop]: Abstraction has 19511 states and 63974 transitions. [2018-12-02 23:44:00,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:44:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 19511 states and 63974 transitions. [2018-12-02 23:44:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:44:00,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:00,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:44:00,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:00,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash -945148663, now seen corresponding path program 1 times [2018-12-02 23:44:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:00,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:00,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:44:00,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:00,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:44:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:44:00,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:44:00,332 INFO L87 Difference]: Start difference. First operand 19511 states and 63974 transitions. Second operand 4 states. [2018-12-02 23:44:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:00,749 INFO L93 Difference]: Finished difference Result 27542 states and 88892 transitions. [2018-12-02 23:44:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:44:00,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 23:44:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:00,784 INFO L225 Difference]: With dead ends: 27542 [2018-12-02 23:44:00,784 INFO L226 Difference]: Without dead ends: 27542 [2018-12-02 23:44:00,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27542 states. [2018-12-02 23:44:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27542 to 24767. [2018-12-02 23:44:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24767 states. [2018-12-02 23:44:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24767 states to 24767 states and 80580 transitions. [2018-12-02 23:44:01,142 INFO L78 Accepts]: Start accepts. Automaton has 24767 states and 80580 transitions. Word has length 72 [2018-12-02 23:44:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:01,143 INFO L480 AbstractCegarLoop]: Abstraction has 24767 states and 80580 transitions. [2018-12-02 23:44:01,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:44:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24767 states and 80580 transitions. [2018-12-02 23:44:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:44:01,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:01,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:44:01,159 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:01,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -594348726, now seen corresponding path program 1 times [2018-12-02 23:44:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:01,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:01,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:01,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:01,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:44:01,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:01,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:44:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:44:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:01,271 INFO L87 Difference]: Start difference. First operand 24767 states and 80580 transitions. Second operand 8 states. [2018-12-02 23:44:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:02,052 INFO L93 Difference]: Finished difference Result 37721 states and 118603 transitions. [2018-12-02 23:44:02,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:44:02,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-02 23:44:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:02,099 INFO L225 Difference]: With dead ends: 37721 [2018-12-02 23:44:02,099 INFO L226 Difference]: Without dead ends: 37473 [2018-12-02 23:44:02,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:44:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37473 states. [2018-12-02 23:44:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37473 to 27364. [2018-12-02 23:44:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27364 states. [2018-12-02 23:44:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27364 states to 27364 states and 88368 transitions. [2018-12-02 23:44:02,461 INFO L78 Accepts]: Start accepts. Automaton has 27364 states and 88368 transitions. Word has length 72 [2018-12-02 23:44:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:02,462 INFO L480 AbstractCegarLoop]: Abstraction has 27364 states and 88368 transitions. [2018-12-02 23:44:02,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:44:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27364 states and 88368 transitions. [2018-12-02 23:44:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:44:02,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:02,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:44:02,479 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:02,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -887751733, now seen corresponding path program 1 times [2018-12-02 23:44:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:02,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:02,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:02,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:02,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-02 23:44:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:02,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:44:02,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:02,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:44:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:44:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:44:02,556 INFO L87 Difference]: Start difference. First operand 27364 states and 88368 transitions. Second operand 6 states. [2018-12-02 23:44:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:02,801 INFO L93 Difference]: Finished difference Result 29954 states and 95614 transitions. [2018-12-02 23:44:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:44:02,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 23:44:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:02,844 INFO L225 Difference]: With dead ends: 29954 [2018-12-02 23:44:02,844 INFO L226 Difference]: Without dead ends: 29954 [2018-12-02 23:44:02,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29954 states. [2018-12-02 23:44:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29954 to 28147. [2018-12-02 23:44:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28147 states. [2018-12-02 23:44:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28147 states to 28147 states and 90561 transitions. [2018-12-02 23:44:03,225 INFO L78 Accepts]: Start accepts. Automaton has 28147 states and 90561 transitions. Word has length 72 [2018-12-02 23:44:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:03,225 INFO L480 AbstractCegarLoop]: Abstraction has 28147 states and 90561 transitions. [2018-12-02 23:44:03,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:44:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28147 states and 90561 transitions. [2018-12-02 23:44:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:44:03,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:03,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:44:03,247 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:03,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:03,247 INFO L82 PathProgramCache]: Analyzing trace with hash 73862284, now seen corresponding path program 1 times [2018-12-02 23:44:03,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:03,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:03,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:44:03,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:03,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:44:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:44:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:03,307 INFO L87 Difference]: Start difference. First operand 28147 states and 90561 transitions. Second operand 5 states. [2018-12-02 23:44:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:03,341 INFO L93 Difference]: Finished difference Result 4691 states and 12177 transitions. [2018-12-02 23:44:03,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:44:03,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 23:44:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:03,345 INFO L225 Difference]: With dead ends: 4691 [2018-12-02 23:44:03,345 INFO L226 Difference]: Without dead ends: 3893 [2018-12-02 23:44:03,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2018-12-02 23:44:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3596. [2018-12-02 23:44:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-12-02 23:44:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 9379 transitions. [2018-12-02 23:44:03,385 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 9379 transitions. Word has length 72 [2018-12-02 23:44:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:03,385 INFO L480 AbstractCegarLoop]: Abstraction has 3596 states and 9379 transitions. [2018-12-02 23:44:03,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:44:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 9379 transitions. [2018-12-02 23:44:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:44:03,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:03,389 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] [2018-12-02 23:44:03,389 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:03,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:03,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1359573718, now seen corresponding path program 1 times [2018-12-02 23:44:03,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:03,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:44:03,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:03,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:44:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:44:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:03,516 INFO L87 Difference]: Start difference. First operand 3596 states and 9379 transitions. Second operand 5 states. [2018-12-02 23:44:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:03,607 INFO L93 Difference]: Finished difference Result 3926 states and 10118 transitions. [2018-12-02 23:44:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:44:03,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 23:44:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:03,610 INFO L225 Difference]: With dead ends: 3926 [2018-12-02 23:44:03,610 INFO L226 Difference]: Without dead ends: 3926 [2018-12-02 23:44:03,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-12-02 23:44:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3634. [2018-12-02 23:44:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-12-02 23:44:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 9483 transitions. [2018-12-02 23:44:03,636 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 9483 transitions. Word has length 91 [2018-12-02 23:44:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 9483 transitions. [2018-12-02 23:44:03,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:44:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 9483 transitions. [2018-12-02 23:44:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:44:03,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:03,639 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] [2018-12-02 23:44:03,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:03,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1302589579, now seen corresponding path program 1 times [2018-12-02 23:44:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:03,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:03,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:44:03,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:44:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:44:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:44:03,685 INFO L87 Difference]: Start difference. First operand 3634 states and 9483 transitions. Second operand 4 states. [2018-12-02 23:44:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:03,768 INFO L93 Difference]: Finished difference Result 4252 states and 10932 transitions. [2018-12-02 23:44:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:44:03,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 23:44:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:03,772 INFO L225 Difference]: With dead ends: 4252 [2018-12-02 23:44:03,772 INFO L226 Difference]: Without dead ends: 4224 [2018-12-02 23:44:03,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:44:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2018-12-02 23:44:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4156. [2018-12-02 23:44:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2018-12-02 23:44:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 10728 transitions. [2018-12-02 23:44:03,805 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 10728 transitions. Word has length 91 [2018-12-02 23:44:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:03,805 INFO L480 AbstractCegarLoop]: Abstraction has 4156 states and 10728 transitions. [2018-12-02 23:44:03,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:44:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 10728 transitions. [2018-12-02 23:44:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:44:03,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:03,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:44:03,808 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:03,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2022796694, now seen corresponding path program 1 times [2018-12-02 23:44:03,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:03,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:03,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:03,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:44:03,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:03,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:44:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:44:03,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:44:03,846 INFO L87 Difference]: Start difference. First operand 4156 states and 10728 transitions. Second operand 4 states. [2018-12-02 23:44:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:03,986 INFO L93 Difference]: Finished difference Result 5141 states and 13366 transitions. [2018-12-02 23:44:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:44:03,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 23:44:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:03,990 INFO L225 Difference]: With dead ends: 5141 [2018-12-02 23:44:03,990 INFO L226 Difference]: Without dead ends: 5141 [2018-12-02 23:44:03,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:44:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2018-12-02 23:44:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4021. [2018-12-02 23:44:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2018-12-02 23:44:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 10331 transitions. [2018-12-02 23:44:04,024 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 10331 transitions. Word has length 91 [2018-12-02 23:44:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:04,024 INFO L480 AbstractCegarLoop]: Abstraction has 4021 states and 10331 transitions. [2018-12-02 23:44:04,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:44:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 10331 transitions. [2018-12-02 23:44:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:44:04,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:04,027 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] [2018-12-02 23:44:04,027 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:04,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1536327676, now seen corresponding path program 2 times [2018-12-02 23:44:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:04,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:44:04,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:04,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:44:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:44:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:04,063 INFO L87 Difference]: Start difference. First operand 4021 states and 10331 transitions. Second operand 5 states. [2018-12-02 23:44:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:04,178 INFO L93 Difference]: Finished difference Result 4493 states and 11451 transitions. [2018-12-02 23:44:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:44:04,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 23:44:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:04,181 INFO L225 Difference]: With dead ends: 4493 [2018-12-02 23:44:04,181 INFO L226 Difference]: Without dead ends: 4465 [2018-12-02 23:44:04,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-02 23:44:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3983. [2018-12-02 23:44:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2018-12-02 23:44:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 10225 transitions. [2018-12-02 23:44:04,212 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 10225 transitions. Word has length 91 [2018-12-02 23:44:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 3983 states and 10225 transitions. [2018-12-02 23:44:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:44:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 10225 transitions. [2018-12-02 23:44:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:44:04,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:04,215 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] [2018-12-02 23:44:04,215 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:04,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash 47520550, now seen corresponding path program 1 times [2018-12-02 23:44:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:04,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:44:04,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:04,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:04,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:44:04,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:04,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:44:04,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:44:04,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:44:04,261 INFO L87 Difference]: Start difference. First operand 3983 states and 10225 transitions. Second operand 6 states. [2018-12-02 23:44:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:04,444 INFO L93 Difference]: Finished difference Result 4367 states and 10977 transitions. [2018-12-02 23:44:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:44:04,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:44:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:04,448 INFO L225 Difference]: With dead ends: 4367 [2018-12-02 23:44:04,448 INFO L226 Difference]: Without dead ends: 4242 [2018-12-02 23:44:04,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2018-12-02 23:44:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 4149. [2018-12-02 23:44:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2018-12-02 23:44:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 10564 transitions. [2018-12-02 23:44:04,475 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 10564 transitions. Word has length 93 [2018-12-02 23:44:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:04,475 INFO L480 AbstractCegarLoop]: Abstraction has 4149 states and 10564 transitions. [2018-12-02 23:44:04,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:44:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 10564 transitions. [2018-12-02 23:44:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:44:04,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:04,477 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] [2018-12-02 23:44:04,478 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:04,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:04,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1748261029, now seen corresponding path program 1 times [2018-12-02 23:44:04,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:44:04,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:04,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:44:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:44:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:04,524 INFO L87 Difference]: Start difference. First operand 4149 states and 10564 transitions. Second operand 7 states. [2018-12-02 23:44:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:04,719 INFO L93 Difference]: Finished difference Result 4483 states and 11383 transitions. [2018-12-02 23:44:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:44:04,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 23:44:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:04,722 INFO L225 Difference]: With dead ends: 4483 [2018-12-02 23:44:04,722 INFO L226 Difference]: Without dead ends: 4483 [2018-12-02 23:44:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2018-12-02 23:44:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 4141. [2018-12-02 23:44:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2018-12-02 23:44:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 10552 transitions. [2018-12-02 23:44:04,749 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 10552 transitions. Word has length 93 [2018-12-02 23:44:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:04,749 INFO L480 AbstractCegarLoop]: Abstraction has 4141 states and 10552 transitions. [2018-12-02 23:44:04,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:44:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 10552 transitions. [2018-12-02 23:44:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:44:04,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:04,752 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] [2018-12-02 23:44:04,752 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:04,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1135826747, now seen corresponding path program 1 times [2018-12-02 23:44:04,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:04,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:04,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:44:04,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:04,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:44:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:44:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:04,816 INFO L87 Difference]: Start difference. First operand 4141 states and 10552 transitions. Second operand 5 states. [2018-12-02 23:44:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:04,897 INFO L93 Difference]: Finished difference Result 3573 states and 9086 transitions. [2018-12-02 23:44:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:44:04,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 23:44:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:04,900 INFO L225 Difference]: With dead ends: 3573 [2018-12-02 23:44:04,900 INFO L226 Difference]: Without dead ends: 3573 [2018-12-02 23:44:04,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:44:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2018-12-02 23:44:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3476. [2018-12-02 23:44:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2018-12-02 23:44:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 8885 transitions. [2018-12-02 23:44:04,927 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 8885 transitions. Word has length 93 [2018-12-02 23:44:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:04,927 INFO L480 AbstractCegarLoop]: Abstraction has 3476 states and 8885 transitions. [2018-12-02 23:44:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:44:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 8885 transitions. [2018-12-02 23:44:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 23:44:04,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:04,930 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] [2018-12-02 23:44:04,930 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:04,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1223480262, now seen corresponding path program 1 times [2018-12-02 23:44:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:04,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:05,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:44:05,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:05,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:44:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:44:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:44:05,001 INFO L87 Difference]: Start difference. First operand 3476 states and 8885 transitions. Second operand 6 states. [2018-12-02 23:44:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:05,100 INFO L93 Difference]: Finished difference Result 3236 states and 8109 transitions. [2018-12-02 23:44:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:44:05,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 23:44:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:05,102 INFO L225 Difference]: With dead ends: 3236 [2018-12-02 23:44:05,102 INFO L226 Difference]: Without dead ends: 3236 [2018-12-02 23:44:05,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-12-02 23:44:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 2830. [2018-12-02 23:44:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2018-12-02 23:44:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7147 transitions. [2018-12-02 23:44:05,121 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7147 transitions. Word has length 93 [2018-12-02 23:44:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:05,121 INFO L480 AbstractCegarLoop]: Abstraction has 2830 states and 7147 transitions. [2018-12-02 23:44:05,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:44:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7147 transitions. [2018-12-02 23:44:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:05,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:05,123 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] [2018-12-02 23:44:05,123 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:05,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1682422135, now seen corresponding path program 1 times [2018-12-02 23:44:05,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:44:05,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:05,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:44:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:44:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:05,175 INFO L87 Difference]: Start difference. First operand 2830 states and 7147 transitions. Second operand 8 states. [2018-12-02 23:44:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:05,459 INFO L93 Difference]: Finished difference Result 4468 states and 11024 transitions. [2018-12-02 23:44:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 23:44:05,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 23:44:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:05,462 INFO L225 Difference]: With dead ends: 4468 [2018-12-02 23:44:05,462 INFO L226 Difference]: Without dead ends: 4468 [2018-12-02 23:44:05,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:44:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2018-12-02 23:44:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3196. [2018-12-02 23:44:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2018-12-02 23:44:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 8035 transitions. [2018-12-02 23:44:05,486 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 8035 transitions. Word has length 95 [2018-12-02 23:44:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:05,487 INFO L480 AbstractCegarLoop]: Abstraction has 3196 states and 8035 transitions. [2018-12-02 23:44:05,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:44:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 8035 transitions. [2018-12-02 23:44:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:05,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:05,489 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] [2018-12-02 23:44:05,489 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:05,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1367780680, now seen corresponding path program 1 times [2018-12-02 23:44:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:05,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:05,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:44:05,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:05,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:44:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:44:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:05,570 INFO L87 Difference]: Start difference. First operand 3196 states and 8035 transitions. Second operand 8 states. [2018-12-02 23:44:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:05,967 INFO L93 Difference]: Finished difference Result 4336 states and 10694 transitions. [2018-12-02 23:44:05,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 23:44:05,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 23:44:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:05,970 INFO L225 Difference]: With dead ends: 4336 [2018-12-02 23:44:05,970 INFO L226 Difference]: Without dead ends: 4282 [2018-12-02 23:44:05,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-12-02 23:44:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-12-02 23:44:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3124. [2018-12-02 23:44:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2018-12-02 23:44:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 7862 transitions. [2018-12-02 23:44:05,996 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 7862 transitions. Word has length 95 [2018-12-02 23:44:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:05,996 INFO L480 AbstractCegarLoop]: Abstraction has 3124 states and 7862 transitions. [2018-12-02 23:44:05,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:44:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 7862 transitions. [2018-12-02 23:44:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:05,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:05,998 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] [2018-12-02 23:44:05,998 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:05,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 991526329, now seen corresponding path program 1 times [2018-12-02 23:44:05,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:05,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:06,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:06,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:44:06,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:06,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:44:06,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:44:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:06,040 INFO L87 Difference]: Start difference. First operand 3124 states and 7862 transitions. Second operand 7 states. [2018-12-02 23:44:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:06,250 INFO L93 Difference]: Finished difference Result 3826 states and 9491 transitions. [2018-12-02 23:44:06,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:44:06,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 23:44:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:06,253 INFO L225 Difference]: With dead ends: 3826 [2018-12-02 23:44:06,253 INFO L226 Difference]: Without dead ends: 3826 [2018-12-02 23:44:06,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:44:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2018-12-02 23:44:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3224. [2018-12-02 23:44:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2018-12-02 23:44:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 8052 transitions. [2018-12-02 23:44:06,278 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 8052 transitions. Word has length 95 [2018-12-02 23:44:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:06,278 INFO L480 AbstractCegarLoop]: Abstraction has 3224 states and 8052 transitions. [2018-12-02 23:44:06,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:44:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 8052 transitions. [2018-12-02 23:44:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:06,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:06,281 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] [2018-12-02 23:44:06,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:06,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 76527609, now seen corresponding path program 1 times [2018-12-02 23:44:06,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:06,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-02 23:44:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:44:06,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:06,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:44:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:44:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:44:06,317 INFO L87 Difference]: Start difference. First operand 3224 states and 8052 transitions. Second operand 5 states. [2018-12-02 23:44:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:06,426 INFO L93 Difference]: Finished difference Result 3576 states and 8916 transitions. [2018-12-02 23:44:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:44:06,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-02 23:44:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:06,428 INFO L225 Difference]: With dead ends: 3576 [2018-12-02 23:44:06,428 INFO L226 Difference]: Without dead ends: 3544 [2018-12-02 23:44:06,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2018-12-02 23:44:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 2675. [2018-12-02 23:44:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2018-12-02 23:44:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 6699 transitions. [2018-12-02 23:44:06,450 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 6699 transitions. Word has length 95 [2018-12-02 23:44:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:06,450 INFO L480 AbstractCegarLoop]: Abstraction has 2675 states and 6699 transitions. [2018-12-02 23:44:06,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:44:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 6699 transitions. [2018-12-02 23:44:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:06,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:06,452 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] [2018-12-02 23:44:06,452 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1321292090, now seen corresponding path program 1 times [2018-12-02 23:44:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:06,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:06,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:44:06,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:06,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:44:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:44:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:44:06,516 INFO L87 Difference]: Start difference. First operand 2675 states and 6699 transitions. Second operand 8 states. [2018-12-02 23:44:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:06,827 INFO L93 Difference]: Finished difference Result 4878 states and 12647 transitions. [2018-12-02 23:44:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 23:44:06,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 23:44:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:06,830 INFO L225 Difference]: With dead ends: 4878 [2018-12-02 23:44:06,830 INFO L226 Difference]: Without dead ends: 4878 [2018-12-02 23:44:06,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:44:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2018-12-02 23:44:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 2605. [2018-12-02 23:44:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-12-02 23:44:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6559 transitions. [2018-12-02 23:44:06,856 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6559 transitions. Word has length 95 [2018-12-02 23:44:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:06,856 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 6559 transitions. [2018-12-02 23:44:06,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:44:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6559 transitions. [2018-12-02 23:44:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:06,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:06,858 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] [2018-12-02 23:44:06,858 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1332501510, now seen corresponding path program 1 times [2018-12-02 23:44:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:06,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:06,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:06,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:44:06,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:06,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:44:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:44:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:44:06,899 INFO L87 Difference]: Start difference. First operand 2605 states and 6559 transitions. Second operand 6 states. [2018-12-02 23:44:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:06,978 INFO L93 Difference]: Finished difference Result 2784 states and 6902 transitions. [2018-12-02 23:44:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:44:06,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 23:44:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:06,981 INFO L225 Difference]: With dead ends: 2784 [2018-12-02 23:44:06,981 INFO L226 Difference]: Without dead ends: 2784 [2018-12-02 23:44:06,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:44:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2018-12-02 23:44:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2638. [2018-12-02 23:44:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2018-12-02 23:44:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6619 transitions. [2018-12-02 23:44:07,009 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6619 transitions. Word has length 95 [2018-12-02 23:44:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:07,010 INFO L480 AbstractCegarLoop]: Abstraction has 2638 states and 6619 transitions. [2018-12-02 23:44:07,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:44:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6619 transitions. [2018-12-02 23:44:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:07,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:07,012 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] [2018-12-02 23:44:07,013 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:07,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1002735749, now seen corresponding path program 1 times [2018-12-02 23:44:07,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:07,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:07,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:44:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:44:07,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:44:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:44:07,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:44:07,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:44:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:44:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:44:07,095 INFO L87 Difference]: Start difference. First operand 2638 states and 6619 transitions. Second operand 7 states. [2018-12-02 23:44:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:44:07,244 INFO L93 Difference]: Finished difference Result 4467 states and 11389 transitions. [2018-12-02 23:44:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:44:07,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 23:44:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:44:07,246 INFO L225 Difference]: With dead ends: 4467 [2018-12-02 23:44:07,246 INFO L226 Difference]: Without dead ends: 1858 [2018-12-02 23:44:07,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:44:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-12-02 23:44:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2018-12-02 23:44:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-12-02 23:44:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 4812 transitions. [2018-12-02 23:44:07,257 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 4812 transitions. Word has length 95 [2018-12-02 23:44:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:44:07,257 INFO L480 AbstractCegarLoop]: Abstraction has 1858 states and 4812 transitions. [2018-12-02 23:44:07,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:44:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 4812 transitions. [2018-12-02 23:44:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 23:44:07,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:44:07,259 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] [2018-12-02 23:44:07,259 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:44:07,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:44:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1809124577, now seen corresponding path program 2 times [2018-12-02 23:44:07,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:44:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:07,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:44:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:44:07,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:44:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:44:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:44:07,297 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:44:07,363 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:44:07,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:44:07 BasicIcfg [2018-12-02 23:44:07,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:44:07,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:44:07,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:44:07,365 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:44:07,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:54" (3/4) ... [2018-12-02 23:44:07,367 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:44:07,430 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5c5f8ee9-a4c7-487c-9ed2-aa82a8940b2f/bin-2019/utaipan/witness.graphml [2018-12-02 23:44:07,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:44:07,431 INFO L168 Benchmark]: Toolchain (without parser) took 14090.43 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 949.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 608.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,431 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.33 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: Boogie Preprocessor took 20.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: RCFGBuilder took 341.48 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: TraceAbstraction took 13302.64 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 541.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,432 INFO L168 Benchmark]: Witness Printer took 65.60 ms. Allocated memory is still 2.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2018-12-02 23:44:07,433 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.33 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 341.48 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13302.64 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 541.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.60 ms. Allocated memory is still 2.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] -1 pthread_t t1593; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] FCALL, FORK -1 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] -1 pthread_t t1594; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] FCALL, FORK -1 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L773] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L784] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L785] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L786] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L788] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L789] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 13.2s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6080 SDtfs, 5517 SDslu, 13055 SDs, 0 SdLazy, 6535 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 67 SyntacticMatches, 22 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37142occurred in iteration=2, 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: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 80470 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2098 NumberOfCodeBlocks, 2098 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1978 ConstructedInterpolants, 0 QuantifiedInterpolants, 417831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...