./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_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_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/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 1e70765932d5ecd399058d3d0c5f33de11a7a07e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:49:36,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:49:36,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:49:36,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:49:36,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:49:36,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:49:36,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:49:36,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:49:36,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:49:36,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:49:36,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:49:36,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:49:36,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:49:36,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:49:36,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:49:36,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:49:36,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:49:36,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:49:36,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:49:36,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:49:36,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:49:36,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:49:36,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:49:36,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:49:36,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:49:36,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:49:36,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:49:36,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:49:36,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:49:36,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:49:36,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:49:36,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:49:36,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:49:36,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:49:36,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:49:36,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:49:36,633 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:49:36,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:49:36,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:49:36,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:49:36,642 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:49:36,642 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:49:36,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:49:36,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:49:36,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:49:36,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:49:36,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:49:36,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:49:36,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:49:36,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:49:36,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:49:36,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:49:36,645 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_b5d2b332-ccad-475f-bd47-277eb8b3354d/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 -> 1e70765932d5ecd399058d3d0c5f33de11a7a07e [2018-12-02 12:49:36,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:49:36,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:49:36,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:49:36,672 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:49:36,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:49:36,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-12-02 12:49:36,711 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/data/4da4013cd/4658879aab774274a14336d64d6f8f92/FLAG474079e4b [2018-12-02 12:49:37,204 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:49:37,205 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-12-02 12:49:37,213 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/data/4da4013cd/4658879aab774274a14336d64d6f8f92/FLAG474079e4b [2018-12-02 12:49:37,692 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/data/4da4013cd/4658879aab774274a14336d64d6f8f92 [2018-12-02 12:49:37,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:49:37,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:49:37,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:37,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:49:37,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:49:37,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:37" (1/1) ... [2018-12-02 12:49:37,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7209347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:37, skipping insertion in model container [2018-12-02 12:49:37,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:37" (1/1) ... [2018-12-02 12:49:37,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:49:37,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:49:37,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:37,912 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:49:37,981 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:38,010 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:49:38,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38 WrapperNode [2018-12-02 12:49:38,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:38,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:38,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:49:38,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:49:38,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:38,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:49:38,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:49:38,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:49:38,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... [2018-12-02 12:49:38,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:49:38,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:49:38,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:49:38,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:49:38,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/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 12:49:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:49:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:49:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 12:49:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:49:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:49:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:49:38,098 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 12:49:38,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:49:38,391 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:49:38,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:38 BoogieIcfgContainer [2018-12-02 12:49:38,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:49:38,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:49:38,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:49:38,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:49:38,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:49:37" (1/3) ... [2018-12-02 12:49:38,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22efe315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:49:38, skipping insertion in model container [2018-12-02 12:49:38,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:38" (2/3) ... [2018-12-02 12:49:38,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22efe315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:49:38, skipping insertion in model container [2018-12-02 12:49:38,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:38" (3/3) ... [2018-12-02 12:49:38,395 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt_false-unreach-call.i [2018-12-02 12:49:38,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,419 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:49:38,435 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:49:38,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:49:38,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:49:38,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:49:38,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:49:38,477 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:49:38,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:49:38,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:49:38,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:49:38,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:49:38,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:49:38,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:49:38,487 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-02 12:49:51,917 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-02 12:49:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-02 12:49:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 12:49:51,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:51,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:51,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:49:51,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-02 12:49:51,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:49:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:49:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:51,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:49:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:49:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:49:52,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:49:52,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:49:52,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:49:52,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:49:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:49:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:49:52,114 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-02 12:49:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:49:53,513 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-02 12:49:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:49:53,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 12:49:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:49:54,315 INFO L225 Difference]: With dead ends: 233475 [2018-12-02 12:49:54,315 INFO L226 Difference]: Without dead ends: 203725 [2018-12-02 12:49:54,317 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 12:49:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-02 12:49:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-02 12:49:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 12:49:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-02 12:49:57,745 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-02 12:49:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:49:57,746 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-02 12:49:57,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:49:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-02 12:49:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:49:57,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:57,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:57,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:49:57,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-02 12:49:57,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:49:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:49:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:57,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:49:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:49:57,816 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 12:49:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:49:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:49:57,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:49:57,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:49:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:49:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:49:57,818 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 5 states. [2018-12-02 12:50:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:00,970 INFO L93 Difference]: Finished difference Result 325275 states and 1470482 transitions. [2018-12-02 12:50:00,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:50:00,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 12:50:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:02,186 INFO L225 Difference]: With dead ends: 325275 [2018-12-02 12:50:02,187 INFO L226 Difference]: Without dead ends: 324275 [2018-12-02 12:50:02,187 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 12:50:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-02 12:50:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-02 12:50:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-02 12:50:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 842877 transitions. [2018-12-02 12:50:08,870 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 842877 transitions. Word has length 53 [2018-12-02 12:50:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:08,871 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 842877 transitions. [2018-12-02 12:50:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:50:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 842877 transitions. [2018-12-02 12:50:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:50:08,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:08,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:50:08,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:08,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-02 12:50:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:08,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:08,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:08,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:08,934 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 12:50:08,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:08,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:50:08,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:08,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:50:08,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:50:08,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:50:08,934 INFO L87 Difference]: Start difference. First operand 186425 states and 842877 transitions. Second operand 4 states. [2018-12-02 12:50:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:09,626 INFO L93 Difference]: Finished difference Result 163601 states and 727065 transitions. [2018-12-02 12:50:09,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:50:09,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 12:50:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:10,028 INFO L225 Difference]: With dead ends: 163601 [2018-12-02 12:50:10,028 INFO L226 Difference]: Without dead ends: 160996 [2018-12-02 12:50:10,028 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 12:50:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-02 12:50:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-02 12:50:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-02 12:50:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718378 transitions. [2018-12-02 12:50:16,173 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718378 transitions. Word has length 54 [2018-12-02 12:50:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:16,174 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718378 transitions. [2018-12-02 12:50:16,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:50:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718378 transitions. [2018-12-02 12:50:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 12:50:16,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:16,178 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] [2018-12-02 12:50:16,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:16,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -955671519, now seen corresponding path program 1 times [2018-12-02 12:50:16,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:16,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:16,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:16,214 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 12:50:16,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:16,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:50:16,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:16,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:50:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:50:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:50:16,215 INFO L87 Difference]: Start difference. First operand 160996 states and 718378 transitions. Second operand 3 states. [2018-12-02 12:50:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:16,921 INFO L93 Difference]: Finished difference Result 160996 states and 718281 transitions. [2018-12-02 12:50:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:50:16,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-02 12:50:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:17,330 INFO L225 Difference]: With dead ends: 160996 [2018-12-02 12:50:17,330 INFO L226 Difference]: Without dead ends: 160996 [2018-12-02 12:50:17,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:50:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-02 12:50:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-02 12:50:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-02 12:50:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718281 transitions. [2018-12-02 12:50:20,381 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718281 transitions. Word has length 55 [2018-12-02 12:50:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:20,381 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718281 transitions. [2018-12-02 12:50:20,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:50:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718281 transitions. [2018-12-02 12:50:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 12:50:20,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:20,385 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] [2018-12-02 12:50:20,386 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:20,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash 787138816, now seen corresponding path program 1 times [2018-12-02 12:50:20,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:20,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:20,431 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 12:50:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:20,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:50:20,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:20,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:50:20,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:50:20,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:50:20,432 INFO L87 Difference]: Start difference. First operand 160996 states and 718281 transitions. Second operand 5 states. [2018-12-02 12:50:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:22,108 INFO L93 Difference]: Finished difference Result 289852 states and 1287334 transitions. [2018-12-02 12:50:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:50:22,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 12:50:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:22,885 INFO L225 Difference]: With dead ends: 289852 [2018-12-02 12:50:22,885 INFO L226 Difference]: Without dead ends: 289012 [2018-12-02 12:50:22,885 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 12:50:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289012 states. [2018-12-02 12:50:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289012 to 169616. [2018-12-02 12:50:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-12-02 12:50:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 753934 transitions. [2018-12-02 12:50:27,545 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 753934 transitions. Word has length 55 [2018-12-02 12:50:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:27,545 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 753934 transitions. [2018-12-02 12:50:27,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:50:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 753934 transitions. [2018-12-02 12:50:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 12:50:27,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:27,564 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] [2018-12-02 12:50:27,564 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:27,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1233238636, now seen corresponding path program 1 times [2018-12-02 12:50:27,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:27,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:27,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:27,597 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 12:50:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:27,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:50:27,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:27,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:50:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:50:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:50:27,598 INFO L87 Difference]: Start difference. First operand 169616 states and 753934 transitions. Second operand 5 states. [2018-12-02 12:50:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:29,503 INFO L93 Difference]: Finished difference Result 59120 states and 239414 transitions. [2018-12-02 12:50:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:50:29,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 12:50:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:29,607 INFO L225 Difference]: With dead ends: 59120 [2018-12-02 12:50:29,607 INFO L226 Difference]: Without dead ends: 56808 [2018-12-02 12:50:29,608 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 12:50:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56808 states. [2018-12-02 12:50:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56808 to 56808. [2018-12-02 12:50:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56808 states. [2018-12-02 12:50:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56808 states to 56808 states and 230752 transitions. [2018-12-02 12:50:30,394 INFO L78 Accepts]: Start accepts. Automaton has 56808 states and 230752 transitions. Word has length 62 [2018-12-02 12:50:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:30,394 INFO L480 AbstractCegarLoop]: Abstraction has 56808 states and 230752 transitions. [2018-12-02 12:50:30,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:50:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56808 states and 230752 transitions. [2018-12-02 12:50:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 12:50:30,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:30,403 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] [2018-12-02 12:50:30,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:30,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 49065616, now seen corresponding path program 1 times [2018-12-02 12:50:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:30,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:30,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:50:30,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:30,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:50:30,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:30,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:50:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:50:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:50:30,456 INFO L87 Difference]: Start difference. First operand 56808 states and 230752 transitions. Second operand 4 states. [2018-12-02 12:50:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:30,838 INFO L93 Difference]: Finished difference Result 78972 states and 316077 transitions. [2018-12-02 12:50:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:50:30,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 12:50:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:30,988 INFO L225 Difference]: With dead ends: 78972 [2018-12-02 12:50:30,988 INFO L226 Difference]: Without dead ends: 78972 [2018-12-02 12:50:30,989 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 12:50:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78972 states. [2018-12-02 12:50:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78972 to 61564. [2018-12-02 12:50:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61564 states. [2018-12-02 12:50:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61564 states to 61564 states and 248445 transitions. [2018-12-02 12:50:32,050 INFO L78 Accepts]: Start accepts. Automaton has 61564 states and 248445 transitions. Word has length 68 [2018-12-02 12:50:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:32,050 INFO L480 AbstractCegarLoop]: Abstraction has 61564 states and 248445 transitions. [2018-12-02 12:50:32,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:50:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 61564 states and 248445 transitions. [2018-12-02 12:50:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 12:50:32,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:32,062 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] [2018-12-02 12:50:32,062 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:32,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1791875951, now seen corresponding path program 1 times [2018-12-02 12:50:32,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:32,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:32,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:32,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:32,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:32,112 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 12:50:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:32,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:50:32,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:32,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:50:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:50:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:50:32,113 INFO L87 Difference]: Start difference. First operand 61564 states and 248445 transitions. Second operand 4 states. [2018-12-02 12:50:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:32,697 INFO L93 Difference]: Finished difference Result 85639 states and 341495 transitions. [2018-12-02 12:50:32,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:50:32,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 12:50:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:32,860 INFO L225 Difference]: With dead ends: 85639 [2018-12-02 12:50:32,861 INFO L226 Difference]: Without dead ends: 85639 [2018-12-02 12:50:32,861 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 12:50:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85639 states. [2018-12-02 12:50:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85639 to 77176. [2018-12-02 12:50:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77176 states. [2018-12-02 12:50:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77176 states to 77176 states and 309674 transitions. [2018-12-02 12:50:34,104 INFO L78 Accepts]: Start accepts. Automaton has 77176 states and 309674 transitions. Word has length 68 [2018-12-02 12:50:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 77176 states and 309674 transitions. [2018-12-02 12:50:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:50:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77176 states and 309674 transitions. [2018-12-02 12:50:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 12:50:34,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:34,118 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] [2018-12-02 12:50:34,118 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:34,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1149781648, now seen corresponding path program 1 times [2018-12-02 12:50:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:34,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:34,187 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 12:50:34,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:34,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:50:34,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:34,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:50:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:50:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:50:34,188 INFO L87 Difference]: Start difference. First operand 77176 states and 309674 transitions. Second operand 6 states. [2018-12-02 12:50:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:34,678 INFO L93 Difference]: Finished difference Result 83796 states and 332727 transitions. [2018-12-02 12:50:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:50:34,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 12:50:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:34,842 INFO L225 Difference]: With dead ends: 83796 [2018-12-02 12:50:34,843 INFO L226 Difference]: Without dead ends: 83796 [2018-12-02 12:50:34,843 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 12:50:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83796 states. [2018-12-02 12:50:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83796 to 79534. [2018-12-02 12:50:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79534 states. [2018-12-02 12:50:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79534 states to 79534 states and 317786 transitions. [2018-12-02 12:50:36,069 INFO L78 Accepts]: Start accepts. Automaton has 79534 states and 317786 transitions. Word has length 68 [2018-12-02 12:50:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:36,069 INFO L480 AbstractCegarLoop]: Abstraction has 79534 states and 317786 transitions. [2018-12-02 12:50:36,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:50:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 79534 states and 317786 transitions. [2018-12-02 12:50:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 12:50:36,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:36,085 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] [2018-12-02 12:50:36,085 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1443184655, now seen corresponding path program 1 times [2018-12-02 12:50:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:36,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:36,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:36,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:36,135 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 12:50:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:50:36,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:36,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:50:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:50:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:50:36,136 INFO L87 Difference]: Start difference. First operand 79534 states and 317786 transitions. Second operand 6 states. [2018-12-02 12:50:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:36,783 INFO L93 Difference]: Finished difference Result 102078 states and 405346 transitions. [2018-12-02 12:50:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:50:36,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 12:50:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:36,996 INFO L225 Difference]: With dead ends: 102078 [2018-12-02 12:50:36,996 INFO L226 Difference]: Without dead ends: 101918 [2018-12-02 12:50:36,996 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 12:50:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101918 states. [2018-12-02 12:50:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101918 to 78062. [2018-12-02 12:50:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78062 states. [2018-12-02 12:50:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78062 states to 78062 states and 311818 transitions. [2018-12-02 12:50:38,338 INFO L78 Accepts]: Start accepts. Automaton has 78062 states and 311818 transitions. Word has length 68 [2018-12-02 12:50:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:38,338 INFO L480 AbstractCegarLoop]: Abstraction has 78062 states and 311818 transitions. [2018-12-02 12:50:38,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:50:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78062 states and 311818 transitions. [2018-12-02 12:50:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:50:38,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:38,390 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] [2018-12-02 12:50:38,391 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 914872836, now seen corresponding path program 1 times [2018-12-02 12:50:38,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:38,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:38,442 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 12:50:38,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:38,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:50:38,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:50:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:50:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:50:38,443 INFO L87 Difference]: Start difference. First operand 78062 states and 311818 transitions. Second operand 4 states. [2018-12-02 12:50:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:39,273 INFO L93 Difference]: Finished difference Result 123918 states and 488650 transitions. [2018-12-02 12:50:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:50:39,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 12:50:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:39,522 INFO L225 Difference]: With dead ends: 123918 [2018-12-02 12:50:39,522 INFO L226 Difference]: Without dead ends: 123102 [2018-12-02 12:50:39,523 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 12:50:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123102 states. [2018-12-02 12:50:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123102 to 105182. [2018-12-02 12:50:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105182 states. [2018-12-02 12:50:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105182 states to 105182 states and 418466 transitions. [2018-12-02 12:50:41,496 INFO L78 Accepts]: Start accepts. Automaton has 105182 states and 418466 transitions. Word has length 82 [2018-12-02 12:50:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:41,496 INFO L480 AbstractCegarLoop]: Abstraction has 105182 states and 418466 transitions. [2018-12-02 12:50:41,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:50:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 105182 states and 418466 transitions. [2018-12-02 12:50:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:50:41,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:41,571 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] [2018-12-02 12:50:41,571 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:41,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2026784763, now seen corresponding path program 1 times [2018-12-02 12:50:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:41,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:41,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:41,643 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 12:50:41,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:41,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:50:41,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:41,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:50:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:50:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:50:41,645 INFO L87 Difference]: Start difference. First operand 105182 states and 418466 transitions. Second operand 6 states. [2018-12-02 12:50:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:42,592 INFO L93 Difference]: Finished difference Result 186559 states and 733507 transitions. [2018-12-02 12:50:42,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:50:42,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 12:50:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:42,999 INFO L225 Difference]: With dead ends: 186559 [2018-12-02 12:50:42,999 INFO L226 Difference]: Without dead ends: 185535 [2018-12-02 12:50:42,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:50:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185535 states. [2018-12-02 12:50:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185535 to 163343. [2018-12-02 12:50:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163343 states. [2018-12-02 12:50:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163343 states to 163343 states and 647995 transitions. [2018-12-02 12:50:46,173 INFO L78 Accepts]: Start accepts. Automaton has 163343 states and 647995 transitions. Word has length 82 [2018-12-02 12:50:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:46,173 INFO L480 AbstractCegarLoop]: Abstraction has 163343 states and 647995 transitions. [2018-12-02 12:50:46,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:50:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 163343 states and 647995 transitions. [2018-12-02 12:50:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:50:46,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:46,294 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] [2018-12-02 12:50:46,294 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:46,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1974779526, now seen corresponding path program 1 times [2018-12-02 12:50:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:46,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:46,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:46,343 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 12:50:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:46,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:50:46,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:46,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:50:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:50:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:50:46,344 INFO L87 Difference]: Start difference. First operand 163343 states and 647995 transitions. Second operand 7 states. [2018-12-02 12:50:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:47,439 INFO L93 Difference]: Finished difference Result 193359 states and 763483 transitions. [2018-12-02 12:50:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:50:47,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 12:50:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:47,872 INFO L225 Difference]: With dead ends: 193359 [2018-12-02 12:50:47,873 INFO L226 Difference]: Without dead ends: 193039 [2018-12-02 12:50:47,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 12:50:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193039 states. [2018-12-02 12:50:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193039 to 172719. [2018-12-02 12:50:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172719 states. [2018-12-02 12:50:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172719 states to 172719 states and 683659 transitions. [2018-12-02 12:50:50,978 INFO L78 Accepts]: Start accepts. Automaton has 172719 states and 683659 transitions. Word has length 82 [2018-12-02 12:50:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:50,978 INFO L480 AbstractCegarLoop]: Abstraction has 172719 states and 683659 transitions. [2018-12-02 12:50:50,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:50:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 172719 states and 683659 transitions. [2018-12-02 12:50:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 12:50:51,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:51,144 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] [2018-12-02 12:50:51,145 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:51,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash 394739894, now seen corresponding path program 1 times [2018-12-02 12:50:51,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:51,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:51,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:50:51,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:51,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:50:51,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:51,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:50:51,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:50:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:50:51,168 INFO L87 Difference]: Start difference. First operand 172719 states and 683659 transitions. Second operand 3 states. [2018-12-02 12:50:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:52,307 INFO L93 Difference]: Finished difference Result 202495 states and 793283 transitions. [2018-12-02 12:50:52,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:50:52,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-02 12:50:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:52,767 INFO L225 Difference]: With dead ends: 202495 [2018-12-02 12:50:52,767 INFO L226 Difference]: Without dead ends: 202495 [2018-12-02 12:50:52,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:50:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202495 states. [2018-12-02 12:50:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202495 to 179711. [2018-12-02 12:50:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179711 states. [2018-12-02 12:50:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179711 states to 179711 states and 708787 transitions. [2018-12-02 12:50:55,749 INFO L78 Accepts]: Start accepts. Automaton has 179711 states and 708787 transitions. Word has length 84 [2018-12-02 12:50:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:55,750 INFO L480 AbstractCegarLoop]: Abstraction has 179711 states and 708787 transitions. [2018-12-02 12:50:55,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:50:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 179711 states and 708787 transitions. [2018-12-02 12:50:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 12:50:55,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:55,942 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] [2018-12-02 12:50:55,942 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:55,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1382200748, now seen corresponding path program 1 times [2018-12-02 12:50:55,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:50:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:50:55,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:50:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:56,031 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 12:50:56,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 12:50:56,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:50:56,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:50:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:50:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:50:56,031 INFO L87 Difference]: Start difference. First operand 179711 states and 708787 transitions. Second operand 10 states. [2018-12-02 12:50:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:58,179 INFO L93 Difference]: Finished difference Result 227791 states and 882395 transitions. [2018-12-02 12:50:58,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 12:50:58,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-02 12:50:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:58,716 INFO L225 Difference]: With dead ends: 227791 [2018-12-02 12:50:58,717 INFO L226 Difference]: Without dead ends: 227471 [2018-12-02 12:50:58,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 12:50:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227471 states. [2018-12-02 12:51:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227471 to 182463. [2018-12-02 12:51:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182463 states. [2018-12-02 12:51:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182463 states to 182463 states and 717107 transitions. [2018-12-02 12:51:04,130 INFO L78 Accepts]: Start accepts. Automaton has 182463 states and 717107 transitions. Word has length 88 [2018-12-02 12:51:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:04,131 INFO L480 AbstractCegarLoop]: Abstraction has 182463 states and 717107 transitions. [2018-12-02 12:51:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:51:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 182463 states and 717107 transitions. [2018-12-02 12:51:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 12:51:04,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:04,340 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] [2018-12-02 12:51:04,340 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:04,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash 595673719, now seen corresponding path program 1 times [2018-12-02 12:51:04,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:04,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:04,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:04,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:04,379 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 12:51:04,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:04,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:51:04,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:04,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:51:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:51:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:51:04,381 INFO L87 Difference]: Start difference. First operand 182463 states and 717107 transitions. Second operand 4 states. [2018-12-02 12:51:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:05,673 INFO L93 Difference]: Finished difference Result 211365 states and 823407 transitions. [2018-12-02 12:51:05,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:51:05,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-02 12:51:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:06,144 INFO L225 Difference]: With dead ends: 211365 [2018-12-02 12:51:06,144 INFO L226 Difference]: Without dead ends: 210661 [2018-12-02 12:51:06,145 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 12:51:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210661 states. [2018-12-02 12:51:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210661 to 203621. [2018-12-02 12:51:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203621 states. [2018-12-02 12:51:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203621 states to 203621 states and 795519 transitions. [2018-12-02 12:51:09,740 INFO L78 Accepts]: Start accepts. Automaton has 203621 states and 795519 transitions. Word has length 90 [2018-12-02 12:51:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:09,741 INFO L480 AbstractCegarLoop]: Abstraction has 203621 states and 795519 transitions. [2018-12-02 12:51:09,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:51:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 203621 states and 795519 transitions. [2018-12-02 12:51:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 12:51:09,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:09,970 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] [2018-12-02 12:51:09,970 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:09,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1339986568, now seen corresponding path program 1 times [2018-12-02 12:51:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:09,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:09,991 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 12:51:09,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:09,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:51:09,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:09,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:51:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:51:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:51:09,992 INFO L87 Difference]: Start difference. First operand 203621 states and 795519 transitions. Second operand 3 states. [2018-12-02 12:51:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:10,982 INFO L93 Difference]: Finished difference Result 214893 states and 837979 transitions. [2018-12-02 12:51:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:51:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-02 12:51:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:11,491 INFO L225 Difference]: With dead ends: 214893 [2018-12-02 12:51:11,492 INFO L226 Difference]: Without dead ends: 214893 [2018-12-02 12:51:11,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:51:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214893 states. [2018-12-02 12:51:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214893 to 209409. [2018-12-02 12:51:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209409 states. [2018-12-02 12:51:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209409 states to 209409 states and 817287 transitions. [2018-12-02 12:51:17,134 INFO L78 Accepts]: Start accepts. Automaton has 209409 states and 817287 transitions. Word has length 90 [2018-12-02 12:51:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:17,134 INFO L480 AbstractCegarLoop]: Abstraction has 209409 states and 817287 transitions. [2018-12-02 12:51:17,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:51:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 209409 states and 817287 transitions. [2018-12-02 12:51:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:51:17,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:17,374 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 12:51:17,374 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:17,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 418119185, now seen corresponding path program 1 times [2018-12-02 12:51:17,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:17,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:17,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:17,411 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 12:51:17,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:17,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:17,412 INFO L87 Difference]: Start difference. First operand 209409 states and 817287 transitions. Second operand 6 states. [2018-12-02 12:51:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:17,511 INFO L93 Difference]: Finished difference Result 27473 states and 91695 transitions. [2018-12-02 12:51:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:17,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 12:51:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:17,540 INFO L225 Difference]: With dead ends: 27473 [2018-12-02 12:51:17,540 INFO L226 Difference]: Without dead ends: 23817 [2018-12-02 12:51:17,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:51:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2018-12-02 12:51:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22672. [2018-12-02 12:51:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22672 states. [2018-12-02 12:51:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22672 states to 22672 states and 75834 transitions. [2018-12-02 12:51:18,004 INFO L78 Accepts]: Start accepts. Automaton has 22672 states and 75834 transitions. Word has length 91 [2018-12-02 12:51:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:18,004 INFO L480 AbstractCegarLoop]: Abstraction has 22672 states and 75834 transitions. [2018-12-02 12:51:18,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22672 states and 75834 transitions. [2018-12-02 12:51:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:51:18,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:18,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:18,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:18,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1222498172, now seen corresponding path program 1 times [2018-12-02 12:51:18,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:18,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:18,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:18,057 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 12:51:18,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:18,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:51:18,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:51:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:51:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:51:18,058 INFO L87 Difference]: Start difference. First operand 22672 states and 75834 transitions. Second operand 5 states. [2018-12-02 12:51:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:18,241 INFO L93 Difference]: Finished difference Result 25406 states and 84381 transitions. [2018-12-02 12:51:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:51:18,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 12:51:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:18,271 INFO L225 Difference]: With dead ends: 25406 [2018-12-02 12:51:18,272 INFO L226 Difference]: Without dead ends: 25266 [2018-12-02 12:51:18,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:51:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25266 states. [2018-12-02 12:51:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25266 to 22807. [2018-12-02 12:51:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22807 states. [2018-12-02 12:51:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22807 states to 22807 states and 76222 transitions. [2018-12-02 12:51:18,506 INFO L78 Accepts]: Start accepts. Automaton has 22807 states and 76222 transitions. Word has length 101 [2018-12-02 12:51:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:18,506 INFO L480 AbstractCegarLoop]: Abstraction has 22807 states and 76222 transitions. [2018-12-02 12:51:18,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:51:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22807 states and 76222 transitions. [2018-12-02 12:51:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:18,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:18,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:18,523 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:18,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1132753799, now seen corresponding path program 1 times [2018-12-02 12:51:18,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:18,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:18,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:18,572 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 12:51:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:18,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:18,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:18,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:18,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:18,573 INFO L87 Difference]: Start difference. First operand 22807 states and 76222 transitions. Second operand 6 states. [2018-12-02 12:51:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:18,940 INFO L93 Difference]: Finished difference Result 25137 states and 83011 transitions. [2018-12-02 12:51:18,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:18,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 12:51:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:18,969 INFO L225 Difference]: With dead ends: 25137 [2018-12-02 12:51:18,969 INFO L226 Difference]: Without dead ends: 24562 [2018-12-02 12:51:18,969 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 12:51:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24562 states. [2018-12-02 12:51:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24562 to 23932. [2018-12-02 12:51:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23932 states. [2018-12-02 12:51:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23932 states to 23932 states and 79657 transitions. [2018-12-02 12:51:19,208 INFO L78 Accepts]: Start accepts. Automaton has 23932 states and 79657 transitions. Word has length 103 [2018-12-02 12:51:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:19,209 INFO L480 AbstractCegarLoop]: Abstraction has 23932 states and 79657 transitions. [2018-12-02 12:51:19,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 23932 states and 79657 transitions. [2018-12-02 12:51:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:19,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:19,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:19,227 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:19,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 567986680, now seen corresponding path program 1 times [2018-12-02 12:51:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:19,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:19,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:19,264 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 12:51:19,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:19,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:51:19,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:19,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:51:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:51:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:51:19,265 INFO L87 Difference]: Start difference. First operand 23932 states and 79657 transitions. Second operand 4 states. [2018-12-02 12:51:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:19,468 INFO L93 Difference]: Finished difference Result 41937 states and 140585 transitions. [2018-12-02 12:51:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:51:19,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 12:51:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:19,519 INFO L225 Difference]: With dead ends: 41937 [2018-12-02 12:51:19,519 INFO L226 Difference]: Without dead ends: 41762 [2018-12-02 12:51:19,520 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 12:51:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41762 states. [2018-12-02 12:51:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41762 to 22612. [2018-12-02 12:51:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22612 states. [2018-12-02 12:51:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22612 states to 22612 states and 74936 transitions. [2018-12-02 12:51:19,840 INFO L78 Accepts]: Start accepts. Automaton has 22612 states and 74936 transitions. Word has length 103 [2018-12-02 12:51:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:19,841 INFO L480 AbstractCegarLoop]: Abstraction has 22612 states and 74936 transitions. [2018-12-02 12:51:19,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:51:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22612 states and 74936 transitions. [2018-12-02 12:51:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:20,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:20,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:20,112 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:20,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash 897752441, now seen corresponding path program 1 times [2018-12-02 12:51:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:20,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:20,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:20,163 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 12:51:20,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:20,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:51:20,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:20,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:51:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:51:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:51:20,164 INFO L87 Difference]: Start difference. First operand 22612 states and 74936 transitions. Second operand 7 states. [2018-12-02 12:51:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:20,463 INFO L93 Difference]: Finished difference Result 23951 states and 79220 transitions. [2018-12-02 12:51:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:20,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 12:51:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:20,490 INFO L225 Difference]: With dead ends: 23951 [2018-12-02 12:51:20,491 INFO L226 Difference]: Without dead ends: 23951 [2018-12-02 12:51:20,491 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 12:51:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2018-12-02 12:51:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 22497. [2018-12-02 12:51:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22497 states. [2018-12-02 12:51:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22497 states to 22497 states and 74624 transitions. [2018-12-02 12:51:20,729 INFO L78 Accepts]: Start accepts. Automaton has 22497 states and 74624 transitions. Word has length 103 [2018-12-02 12:51:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:20,729 INFO L480 AbstractCegarLoop]: Abstraction has 22497 states and 74624 transitions. [2018-12-02 12:51:20,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:51:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22497 states and 74624 transitions. [2018-12-02 12:51:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:20,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:20,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:20,748 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1986335335, now seen corresponding path program 1 times [2018-12-02 12:51:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:20,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:20,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:20,785 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 12:51:20,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:20,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:51:20,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:20,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:51:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:51:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:51:20,786 INFO L87 Difference]: Start difference. First operand 22497 states and 74624 transitions. Second operand 5 states. [2018-12-02 12:51:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:20,990 INFO L93 Difference]: Finished difference Result 44446 states and 147922 transitions. [2018-12-02 12:51:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:20,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 12:51:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:21,044 INFO L225 Difference]: With dead ends: 44446 [2018-12-02 12:51:21,044 INFO L226 Difference]: Without dead ends: 44316 [2018-12-02 12:51:21,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:51:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44316 states. [2018-12-02 12:51:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44316 to 23007. [2018-12-02 12:51:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23007 states. [2018-12-02 12:51:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23007 states to 23007 states and 76132 transitions. [2018-12-02 12:51:21,387 INFO L78 Accepts]: Start accepts. Automaton has 23007 states and 76132 transitions. Word has length 103 [2018-12-02 12:51:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 23007 states and 76132 transitions. [2018-12-02 12:51:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:51:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 23007 states and 76132 transitions. [2018-12-02 12:51:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:21,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:21,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:21,405 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:21,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1195895208, now seen corresponding path program 1 times [2018-12-02 12:51:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:21,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:21,466 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 12:51:21,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:21,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:51:21,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:21,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:51:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:51:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:51:21,468 INFO L87 Difference]: Start difference. First operand 23007 states and 76132 transitions. Second operand 5 states. [2018-12-02 12:51:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:21,588 INFO L93 Difference]: Finished difference Result 21568 states and 71296 transitions. [2018-12-02 12:51:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:51:21,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 12:51:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:21,612 INFO L225 Difference]: With dead ends: 21568 [2018-12-02 12:51:21,612 INFO L226 Difference]: Without dead ends: 21568 [2018-12-02 12:51:21,612 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 12:51:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21568 states. [2018-12-02 12:51:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21568 to 20638. [2018-12-02 12:51:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20638 states. [2018-12-02 12:51:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20638 states to 20638 states and 68542 transitions. [2018-12-02 12:51:21,821 INFO L78 Accepts]: Start accepts. Automaton has 20638 states and 68542 transitions. Word has length 103 [2018-12-02 12:51:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:21,822 INFO L480 AbstractCegarLoop]: Abstraction has 20638 states and 68542 transitions. [2018-12-02 12:51:21,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:51:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20638 states and 68542 transitions. [2018-12-02 12:51:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:21,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:21,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:21,838 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:21,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:21,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1934972648, now seen corresponding path program 1 times [2018-12-02 12:51:21,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:21,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:21,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:21,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:21,905 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 12:51:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:21,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:21,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:21,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:21,906 INFO L87 Difference]: Start difference. First operand 20638 states and 68542 transitions. Second operand 6 states. [2018-12-02 12:51:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:22,041 INFO L93 Difference]: Finished difference Result 19166 states and 62862 transitions. [2018-12-02 12:51:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:51:22,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 12:51:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:22,062 INFO L225 Difference]: With dead ends: 19166 [2018-12-02 12:51:22,062 INFO L226 Difference]: Without dead ends: 19166 [2018-12-02 12:51:22,062 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 12:51:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19166 states. [2018-12-02 12:51:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19166 to 16873. [2018-12-02 12:51:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16873 states. [2018-12-02 12:51:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16873 states to 16873 states and 55725 transitions. [2018-12-02 12:51:22,292 INFO L78 Accepts]: Start accepts. Automaton has 16873 states and 55725 transitions. Word has length 103 [2018-12-02 12:51:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:22,292 INFO L480 AbstractCegarLoop]: Abstraction has 16873 states and 55725 transitions. [2018-12-02 12:51:22,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16873 states and 55725 transitions. [2018-12-02 12:51:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:22,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:22,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:22,304 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:22,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 425338674, now seen corresponding path program 1 times [2018-12-02 12:51:22,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:22,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:22,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:22,366 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 12:51:22,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:22,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:51:22,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:22,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:51:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:51:22,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:51:22,367 INFO L87 Difference]: Start difference. First operand 16873 states and 55725 transitions. Second operand 8 states. [2018-12-02 12:51:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:22,713 INFO L93 Difference]: Finished difference Result 27122 states and 87689 transitions. [2018-12-02 12:51:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 12:51:22,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-12-02 12:51:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:22,744 INFO L225 Difference]: With dead ends: 27122 [2018-12-02 12:51:22,744 INFO L226 Difference]: Without dead ends: 26994 [2018-12-02 12:51:22,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 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 12:51:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26994 states. [2018-12-02 12:51:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26994 to 19701. [2018-12-02 12:51:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19701 states. [2018-12-02 12:51:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19701 states to 19701 states and 64668 transitions. [2018-12-02 12:51:22,977 INFO L78 Accepts]: Start accepts. Automaton has 19701 states and 64668 transitions. Word has length 105 [2018-12-02 12:51:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:22,978 INFO L480 AbstractCegarLoop]: Abstraction has 19701 states and 64668 transitions. [2018-12-02 12:51:22,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:51:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 19701 states and 64668 transitions. [2018-12-02 12:51:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:22,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:22,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:22,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:22,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1670103155, now seen corresponding path program 1 times [2018-12-02 12:51:22,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:22,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:22,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:23,060 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 12:51:23,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:23,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:23,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:23,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:23,061 INFO L87 Difference]: Start difference. First operand 19701 states and 64668 transitions. Second operand 6 states. [2018-12-02 12:51:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:23,145 INFO L93 Difference]: Finished difference Result 20491 states and 66605 transitions. [2018-12-02 12:51:23,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:23,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 12:51:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:23,168 INFO L225 Difference]: With dead ends: 20491 [2018-12-02 12:51:23,168 INFO L226 Difference]: Without dead ends: 20391 [2018-12-02 12:51:23,168 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 12:51:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20391 states. [2018-12-02 12:51:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20391 to 19226. [2018-12-02 12:51:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19226 states. [2018-12-02 12:51:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 63003 transitions. [2018-12-02 12:51:23,369 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 63003 transitions. Word has length 105 [2018-12-02 12:51:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:23,369 INFO L480 AbstractCegarLoop]: Abstraction has 19226 states and 63003 transitions. [2018-12-02 12:51:23,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 63003 transitions. [2018-12-02 12:51:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:23,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:23,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:23,385 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:23,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -653924684, now seen corresponding path program 1 times [2018-12-02 12:51:23,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:23,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:23,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:51:23,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:23,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:23,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:23,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:23,436 INFO L87 Difference]: Start difference. First operand 19226 states and 63003 transitions. Second operand 6 states. [2018-12-02 12:51:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:23,583 INFO L93 Difference]: Finished difference Result 20281 states and 65987 transitions. [2018-12-02 12:51:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:51:23,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 12:51:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:23,606 INFO L225 Difference]: With dead ends: 20281 [2018-12-02 12:51:23,606 INFO L226 Difference]: Without dead ends: 20281 [2018-12-02 12:51:23,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:51:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2018-12-02 12:51:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 19361. [2018-12-02 12:51:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19361 states. [2018-12-02 12:51:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19361 states to 19361 states and 63386 transitions. [2018-12-02 12:51:23,805 INFO L78 Accepts]: Start accepts. Automaton has 19361 states and 63386 transitions. Word has length 105 [2018-12-02 12:51:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:23,805 INFO L480 AbstractCegarLoop]: Abstraction has 19361 states and 63386 transitions. [2018-12-02 12:51:23,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19361 states and 63386 transitions. [2018-12-02 12:51:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:23,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:23,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:23,821 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:23,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1568923404, now seen corresponding path program 1 times [2018-12-02 12:51:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:23,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:23,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:51:23,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:23,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:51:23,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:23,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:51:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:51:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:51:23,855 INFO L87 Difference]: Start difference. First operand 19361 states and 63386 transitions. Second operand 5 states. [2018-12-02 12:51:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:23,998 INFO L93 Difference]: Finished difference Result 21537 states and 70394 transitions. [2018-12-02 12:51:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:51:23,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 12:51:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:24,022 INFO L225 Difference]: With dead ends: 21537 [2018-12-02 12:51:24,022 INFO L226 Difference]: Without dead ends: 21409 [2018-12-02 12:51:24,022 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 12:51:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21409 states. [2018-12-02 12:51:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21409 to 17190. [2018-12-02 12:51:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17190 states. [2018-12-02 12:51:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17190 states to 17190 states and 56395 transitions. [2018-12-02 12:51:24,215 INFO L78 Accepts]: Start accepts. Automaton has 17190 states and 56395 transitions. Word has length 105 [2018-12-02 12:51:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:24,216 INFO L480 AbstractCegarLoop]: Abstraction has 17190 states and 56395 transitions. [2018-12-02 12:51:24,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:51:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 17190 states and 56395 transitions. [2018-12-02 12:51:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:24,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:24,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:24,230 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:24,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -324158923, now seen corresponding path program 1 times [2018-12-02 12:51:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:51:24,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:51:24,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:51:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:51:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:51:24,299 INFO L87 Difference]: Start difference. First operand 17190 states and 56395 transitions. Second operand 9 states. [2018-12-02 12:51:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:24,490 INFO L93 Difference]: Finished difference Result 32542 states and 107441 transitions. [2018-12-02 12:51:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:51:24,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 12:51:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:24,508 INFO L225 Difference]: With dead ends: 32542 [2018-12-02 12:51:24,508 INFO L226 Difference]: Without dead ends: 16578 [2018-12-02 12:51:24,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:51:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2018-12-02 12:51:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 16578. [2018-12-02 12:51:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16578 states. [2018-12-02 12:51:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16578 states to 16578 states and 54595 transitions. [2018-12-02 12:51:24,677 INFO L78 Accepts]: Start accepts. Automaton has 16578 states and 54595 transitions. Word has length 105 [2018-12-02 12:51:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:24,677 INFO L480 AbstractCegarLoop]: Abstraction has 16578 states and 54595 transitions. [2018-12-02 12:51:24,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:51:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16578 states and 54595 transitions. [2018-12-02 12:51:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:24,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:24,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:24,690 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:24,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:24,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1916571609, now seen corresponding path program 2 times [2018-12-02 12:51:24,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:51:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:24,749 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 12:51:24,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:24,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:51:24,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:24,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:51:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:51:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:51:24,750 INFO L87 Difference]: Start difference. First operand 16578 states and 54595 transitions. Second operand 9 states. [2018-12-02 12:51:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:24,886 INFO L93 Difference]: Finished difference Result 24558 states and 81436 transitions. [2018-12-02 12:51:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:51:24,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 12:51:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:24,895 INFO L225 Difference]: With dead ends: 24558 [2018-12-02 12:51:24,895 INFO L226 Difference]: Without dead ends: 8274 [2018-12-02 12:51:24,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:51:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8274 states. [2018-12-02 12:51:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8274 to 8274. [2018-12-02 12:51:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2018-12-02 12:51:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 27625 transitions. [2018-12-02 12:51:24,972 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 27625 transitions. Word has length 105 [2018-12-02 12:51:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:24,973 INFO L480 AbstractCegarLoop]: Abstraction has 8274 states and 27625 transitions. [2018-12-02 12:51:24,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:51:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 27625 transitions. [2018-12-02 12:51:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:24,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:24,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:24,979 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:24,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:24,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1439351056, now seen corresponding path program 2 times [2018-12-02 12:51:24,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:51:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:24,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:51:25,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:25,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:51:25,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:25,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:51:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:51:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:51:25,038 INFO L87 Difference]: Start difference. First operand 8274 states and 27625 transitions. Second operand 6 states. [2018-12-02 12:51:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:25,205 INFO L93 Difference]: Finished difference Result 8785 states and 29033 transitions. [2018-12-02 12:51:25,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:51:25,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 12:51:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:25,214 INFO L225 Difference]: With dead ends: 8785 [2018-12-02 12:51:25,214 INFO L226 Difference]: Without dead ends: 8785 [2018-12-02 12:51:25,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:51:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8785 states. [2018-12-02 12:51:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8785 to 8372. [2018-12-02 12:51:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8372 states. [2018-12-02 12:51:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8372 states to 8372 states and 27950 transitions. [2018-12-02 12:51:25,297 INFO L78 Accepts]: Start accepts. Automaton has 8372 states and 27950 transitions. Word has length 105 [2018-12-02 12:51:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:25,297 INFO L480 AbstractCegarLoop]: Abstraction has 8372 states and 27950 transitions. [2018-12-02 12:51:25,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:51:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8372 states and 27950 transitions. [2018-12-02 12:51:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:25,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:25,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:25,303 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:25,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1109585295, now seen corresponding path program 3 times [2018-12-02 12:51:25,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:25,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:25,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:51:25,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:25,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:51:25,410 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 12:51:25,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:51:25,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:51:25,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:51:25,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:51:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:51:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:51:25,411 INFO L87 Difference]: Start difference. First operand 8372 states and 27950 transitions. Second operand 12 states. [2018-12-02 12:51:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:25,811 INFO L93 Difference]: Finished difference Result 15960 states and 53605 transitions. [2018-12-02 12:51:25,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:51:25,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 12:51:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:25,823 INFO L225 Difference]: With dead ends: 15960 [2018-12-02 12:51:25,823 INFO L226 Difference]: Without dead ends: 11416 [2018-12-02 12:51:25,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 12:51:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11416 states. [2018-12-02 12:51:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11416 to 10736. [2018-12-02 12:51:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2018-12-02 12:51:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 35223 transitions. [2018-12-02 12:51:25,928 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 35223 transitions. Word has length 105 [2018-12-02 12:51:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 10736 states and 35223 transitions. [2018-12-02 12:51:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:51:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 35223 transitions. [2018-12-02 12:51:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:51:25,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:25,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:25,936 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:25,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2061613685, now seen corresponding path program 4 times [2018-12-02 12:51:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:51:25,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:25,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:51:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:51:25,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:51:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:51:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:51:25,972 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:51:26,040 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:51:26,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:51:26 BasicIcfg [2018-12-02 12:51:26,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:51:26,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:51:26,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:51:26,041 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:51:26,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:38" (3/4) ... [2018-12-02 12:51:26,043 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:51:26,121 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b5d2b332-ccad-475f-bd47-277eb8b3354d/bin-2019/utaipan/witness.graphml [2018-12-02 12:51:26,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:51:26,122 INFO L168 Benchmark]: Toolchain (without parser) took 108427.65 ms. Allocated memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: 7.1 GB). Free memory was 953.5 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: Boogie Preprocessor took 19.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: RCFGBuilder took 326.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: TraceAbstraction took 107649.04 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-02 12:51:26,123 INFO L168 Benchmark]: Witness Printer took 80.32 ms. Allocated memory is still 8.2 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:51:26,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 326.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107649.04 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 80.32 ms. Allocated memory is still 8.2 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1116; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1116, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1117; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1117, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1118; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1118, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 107.5s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 31.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9036 SDtfs, 9868 SDslu, 22095 SDs, 0 SdLazy, 7885 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 104 SyntacticMatches, 20 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209409occurred in iteration=17, 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: 59.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 600873 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2950 NumberOfCodeBlocks, 2950 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2812 ConstructedInterpolants, 0 QuantifiedInterpolants, 611821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...