./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:37:23,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:37:23,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:37:23,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:37:23,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:37:23,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:37:23,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:37:23,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:37:23,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:37:23,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:37:23,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:37:23,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:37:23,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:37:23,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:37:23,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:37:23,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:37:23,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:37:23,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:37:23,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:37:23,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:37:23,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:37:23,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:37:23,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:37:23,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:37:23,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:37:23,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:37:23,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:37:23,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:37:23,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:37:23,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:37:23,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:37:23,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:37:23,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:37:23,768 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:37:23,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:37:23,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:37:23,769 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:37:23,780 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:37:23,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:37:23,788 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:37:23,788 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:37:23,788 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:37:23,789 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:37:23,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:37:23,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:37:23,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:37:23,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:37:23,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:37:23,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:37:23,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:37:23,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:37:23,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:37:23,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:37:23,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:37:23,793 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_28beed27-5d3e-4729-b90d-79aac90ed5de/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-10-26 19:37:23,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:37:23,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:37:23,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:37:23,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:37:23,837 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:37:23,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:37:23,881 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/data/3b2fe56df/b7b64c2a018e4da48e234ce4d2043609/FLAGaf1cee982 [2018-10-26 19:37:24,275 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:37:24,276 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:37:24,284 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/data/3b2fe56df/b7b64c2a018e4da48e234ce4d2043609/FLAGaf1cee982 [2018-10-26 19:37:24,295 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/data/3b2fe56df/b7b64c2a018e4da48e234ce4d2043609 [2018-10-26 19:37:24,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:37:24,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:37:24,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:37:24,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:37:24,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:37:24,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14956367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24, skipping insertion in model container [2018-10-26 19:37:24,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:37:24,330 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:37:24,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:37:24,462 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:37:24,484 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:37:24,496 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:37:24,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24 WrapperNode [2018-10-26 19:37:24,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:37:24,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:37:24,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:37:24,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:37:24,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:37:24,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:37:24,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:37:24,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:37:24,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... [2018-10-26 19:37:24,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:37:24,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:37:24,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:37:24,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:37:24,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/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-10-26 19:37:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:37:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:37:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:37:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:37:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:37:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:37:25,213 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:37:25,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:37:25 BoogieIcfgContainer [2018-10-26 19:37:25,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:37:25,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:37:25,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:37:25,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:37:25,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:37:24" (1/3) ... [2018-10-26 19:37:25,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9f155d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:37:25, skipping insertion in model container [2018-10-26 19:37:25,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:37:24" (2/3) ... [2018-10-26 19:37:25,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9f155d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:37:25, skipping insertion in model container [2018-10-26 19:37:25,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:37:25" (3/3) ... [2018-10-26 19:37:25,221 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 19:37:25,230 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:37:25,239 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:37:25,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:37:25,297 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:37:25,297 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:37:25,297 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:37:25,297 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:37:25,297 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:37:25,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:37:25,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:37:25,298 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:37:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-10-26 19:37:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:37:25,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:25,322 INFO L375 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] [2018-10-26 19:37:25,325 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:25,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-10-26 19:37:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:25,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:25,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:25,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:25,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:25,584 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-10-26 19:37:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:25,656 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-10-26 19:37:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:25,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 19:37:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:25,668 INFO L225 Difference]: With dead ends: 101 [2018-10-26 19:37:25,668 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 19:37:25,671 INFO L605 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-10-26 19:37:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 19:37:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-10-26 19:37:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-26 19:37:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-10-26 19:37:25,709 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-10-26 19:37:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:25,709 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-10-26 19:37:25,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-10-26 19:37:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:37:25,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:25,710 INFO L375 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] [2018-10-26 19:37:25,712 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:25,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-10-26 19:37:25,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:25,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:25,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:25,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:25,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:25,798 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:25,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:25,800 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-10-26 19:37:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:25,848 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-10-26 19:37:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:25,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 19:37:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:25,856 INFO L225 Difference]: With dead ends: 140 [2018-10-26 19:37:25,856 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 19:37:25,857 INFO L605 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-10-26 19:37:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 19:37:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-10-26 19:37:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-26 19:37:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-10-26 19:37:25,864 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-10-26 19:37:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:25,864 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-10-26 19:37:25,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-10-26 19:37:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:37:25,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:25,865 INFO L375 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] [2018-10-26 19:37:25,865 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:25,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-10-26 19:37:25,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:25,867 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:25,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:25,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:25,957 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-10-26 19:37:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:25,996 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-10-26 19:37:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:25,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:37:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:25,999 INFO L225 Difference]: With dead ends: 130 [2018-10-26 19:37:25,999 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 19:37:26,002 INFO L605 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-10-26 19:37:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 19:37:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-26 19:37:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-26 19:37:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-10-26 19:37:26,010 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-10-26 19:37:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,010 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-10-26 19:37:26,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-10-26 19:37:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:37:26,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,011 INFO L375 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] [2018-10-26 19:37:26,011 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-10-26 19:37:26,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,052 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-10-26 19:37:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,122 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-10-26 19:37:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:37:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,124 INFO L225 Difference]: With dead ends: 165 [2018-10-26 19:37:26,124 INFO L226 Difference]: Without dead ends: 163 [2018-10-26 19:37:26,125 INFO L605 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-10-26 19:37:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-26 19:37:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-10-26 19:37:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-26 19:37:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-10-26 19:37:26,141 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-10-26 19:37:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,141 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-10-26 19:37:26,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-10-26 19:37:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:37:26,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,142 INFO L375 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] [2018-10-26 19:37:26,143 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-10-26 19:37:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,229 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-10-26 19:37:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,268 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-10-26 19:37:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 19:37:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,269 INFO L225 Difference]: With dead ends: 271 [2018-10-26 19:37:26,270 INFO L226 Difference]: Without dead ends: 165 [2018-10-26 19:37:26,270 INFO L605 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-10-26 19:37:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-26 19:37:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-26 19:37:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-26 19:37:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-10-26 19:37:26,283 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-10-26 19:37:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,284 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-10-26 19:37:26,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-10-26 19:37:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:37:26,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,285 INFO L375 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] [2018-10-26 19:37:26,285 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-10-26 19:37:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,361 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-10-26 19:37:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,391 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-10-26 19:37:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:37:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,393 INFO L225 Difference]: With dead ends: 244 [2018-10-26 19:37:26,393 INFO L226 Difference]: Without dead ends: 167 [2018-10-26 19:37:26,393 INFO L605 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-10-26 19:37:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-26 19:37:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-26 19:37:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-26 19:37:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-10-26 19:37:26,406 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-10-26 19:37:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,407 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-10-26 19:37:26,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-10-26 19:37:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:37:26,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,410 INFO L375 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] [2018-10-26 19:37:26,411 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-10-26 19:37:26,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,498 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-10-26 19:37:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,541 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-10-26 19:37:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:37:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,543 INFO L225 Difference]: With dead ends: 309 [2018-10-26 19:37:26,543 INFO L226 Difference]: Without dead ends: 307 [2018-10-26 19:37:26,544 INFO L605 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-10-26 19:37:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-26 19:37:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-10-26 19:37:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-26 19:37:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-10-26 19:37:26,555 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-10-26 19:37:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,556 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-10-26 19:37:26,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-10-26 19:37:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:37:26,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,557 INFO L375 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] [2018-10-26 19:37:26,557 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-10-26 19:37:26,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,602 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-10-26 19:37:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,641 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-10-26 19:37:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:37:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,643 INFO L225 Difference]: With dead ends: 525 [2018-10-26 19:37:26,643 INFO L226 Difference]: Without dead ends: 315 [2018-10-26 19:37:26,644 INFO L605 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-10-26 19:37:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-26 19:37:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-26 19:37:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-26 19:37:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-10-26 19:37:26,657 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-10-26 19:37:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,657 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-10-26 19:37:26,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-10-26 19:37:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:37:26,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,658 INFO L375 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] [2018-10-26 19:37:26,658 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-10-26 19:37:26,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,729 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-10-26 19:37:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,801 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-10-26 19:37:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:37:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,803 INFO L225 Difference]: With dead ends: 469 [2018-10-26 19:37:26,803 INFO L226 Difference]: Without dead ends: 319 [2018-10-26 19:37:26,803 INFO L605 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-10-26 19:37:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-26 19:37:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-26 19:37:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-26 19:37:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-10-26 19:37:26,811 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-10-26 19:37:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,812 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-10-26 19:37:26,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-10-26 19:37:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:37:26,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,813 INFO L375 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] [2018-10-26 19:37:26,813 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-10-26 19:37:26,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:26,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:26,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:26,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:26,873 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-10-26 19:37:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:26,907 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-10-26 19:37:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:26,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:37:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:26,909 INFO L225 Difference]: With dead ends: 589 [2018-10-26 19:37:26,910 INFO L226 Difference]: Without dead ends: 587 [2018-10-26 19:37:26,910 INFO L605 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-10-26 19:37:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-26 19:37:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-10-26 19:37:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-26 19:37:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-10-26 19:37:26,925 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-10-26 19:37:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:26,925 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-10-26 19:37:26,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-10-26 19:37:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:37:26,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:26,927 INFO L375 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] [2018-10-26 19:37:26,927 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:26,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-10-26 19:37:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:26,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:27,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:27,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:27,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:27,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:27,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:27,002 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-10-26 19:37:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:27,102 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-10-26 19:37:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:27,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:37:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:27,104 INFO L225 Difference]: With dead ends: 1029 [2018-10-26 19:37:27,105 INFO L226 Difference]: Without dead ends: 611 [2018-10-26 19:37:27,106 INFO L605 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-10-26 19:37:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-26 19:37:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-10-26 19:37:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-10-26 19:37:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-10-26 19:37:27,131 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-10-26 19:37:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:27,132 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-10-26 19:37:27,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-10-26 19:37:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:37:27,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:27,133 INFO L375 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] [2018-10-26 19:37:27,134 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:27,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-10-26 19:37:27,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:27,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:27,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:27,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:27,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:27,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:27,210 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-10-26 19:37:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:27,313 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-10-26 19:37:27,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:27,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:37:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:27,316 INFO L225 Difference]: With dead ends: 913 [2018-10-26 19:37:27,316 INFO L226 Difference]: Without dead ends: 619 [2018-10-26 19:37:27,317 INFO L605 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-10-26 19:37:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-26 19:37:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-10-26 19:37:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-26 19:37:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-10-26 19:37:27,337 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-10-26 19:37:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:27,338 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-10-26 19:37:27,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-10-26 19:37:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:37:27,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:27,339 INFO L375 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] [2018-10-26 19:37:27,339 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:27,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-10-26 19:37:27,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:27,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:27,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:27,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:27,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:27,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:27,409 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-10-26 19:37:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:27,510 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-10-26 19:37:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:27,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:37:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:27,515 INFO L225 Difference]: With dead ends: 1789 [2018-10-26 19:37:27,515 INFO L226 Difference]: Without dead ends: 1195 [2018-10-26 19:37:27,517 INFO L605 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-10-26 19:37:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-10-26 19:37:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-10-26 19:37:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-10-26 19:37:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-10-26 19:37:27,552 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-10-26 19:37:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:27,552 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-10-26 19:37:27,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-10-26 19:37:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:37:27,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:27,554 INFO L375 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] [2018-10-26 19:37:27,554 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:27,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-10-26 19:37:27,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:27,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:27,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:27,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:27,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:27,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:27,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:27,629 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-10-26 19:37:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:27,718 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-10-26 19:37:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:27,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 19:37:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:27,724 INFO L225 Difference]: With dead ends: 1469 [2018-10-26 19:37:27,724 INFO L226 Difference]: Without dead ends: 1467 [2018-10-26 19:37:27,726 INFO L605 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-10-26 19:37:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-10-26 19:37:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-10-26 19:37:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-10-26 19:37:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-10-26 19:37:27,766 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-10-26 19:37:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:27,766 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-10-26 19:37:27,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-10-26 19:37:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:37:27,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:27,769 INFO L375 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] [2018-10-26 19:37:27,770 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:27,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-10-26 19:37:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:27,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:27,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:27,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:27,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:27,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:27,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:27,842 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-10-26 19:37:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:27,960 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-10-26 19:37:27,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:27,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:37:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:27,968 INFO L225 Difference]: With dead ends: 2173 [2018-10-26 19:37:27,968 INFO L226 Difference]: Without dead ends: 2171 [2018-10-26 19:37:27,970 INFO L605 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-10-26 19:37:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-10-26 19:37:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-10-26 19:37:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-10-26 19:37:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-10-26 19:37:28,026 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-10-26 19:37:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:28,026 INFO L481 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-10-26 19:37:28,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-10-26 19:37:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:37:28,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:28,032 INFO L375 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] [2018-10-26 19:37:28,032 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:28,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-10-26 19:37:28,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:28,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:28,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:28,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:28,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:28,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:28,105 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-10-26 19:37:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:28,236 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-10-26 19:37:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:28,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 19:37:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:28,245 INFO L225 Difference]: With dead ends: 3997 [2018-10-26 19:37:28,245 INFO L226 Difference]: Without dead ends: 2331 [2018-10-26 19:37:28,248 INFO L605 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-10-26 19:37:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-10-26 19:37:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-10-26 19:37:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-10-26 19:37:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-10-26 19:37:28,318 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-10-26 19:37:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:28,318 INFO L481 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-10-26 19:37:28,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-10-26 19:37:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:37:28,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:28,323 INFO L375 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] [2018-10-26 19:37:28,323 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:28,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-10-26 19:37:28,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:28,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:28,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:28,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:28,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:28,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:28,390 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-10-26 19:37:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:28,515 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-10-26 19:37:28,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:28,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:37:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:28,523 INFO L225 Difference]: With dead ends: 3517 [2018-10-26 19:37:28,524 INFO L226 Difference]: Without dead ends: 2379 [2018-10-26 19:37:28,527 INFO L605 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-10-26 19:37:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-10-26 19:37:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-10-26 19:37:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-10-26 19:37:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-10-26 19:37:28,599 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-10-26 19:37:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:28,599 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-10-26 19:37:28,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-10-26 19:37:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:37:28,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:28,602 INFO L375 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] [2018-10-26 19:37:28,602 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:28,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-10-26 19:37:28,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:28,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:28,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:28,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:28,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:28,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:28,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:28,678 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-10-26 19:37:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:28,830 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-10-26 19:37:28,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:28,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:37:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:28,843 INFO L225 Difference]: With dead ends: 4237 [2018-10-26 19:37:28,843 INFO L226 Difference]: Without dead ends: 4235 [2018-10-26 19:37:28,845 INFO L605 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-10-26 19:37:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-10-26 19:37:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-10-26 19:37:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-10-26 19:37:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-10-26 19:37:28,929 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-10-26 19:37:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:28,929 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-10-26 19:37:28,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-10-26 19:37:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:37:28,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:28,935 INFO L375 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] [2018-10-26 19:37:28,936 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:28,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-10-26 19:37:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:28,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:29,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:29,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:29,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:29,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:29,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:29,001 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-10-26 19:37:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:29,160 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-10-26 19:37:29,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:29,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:37:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:29,173 INFO L225 Difference]: With dead ends: 7949 [2018-10-26 19:37:29,173 INFO L226 Difference]: Without dead ends: 4619 [2018-10-26 19:37:29,179 INFO L605 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-10-26 19:37:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-10-26 19:37:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-10-26 19:37:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-10-26 19:37:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-10-26 19:37:29,289 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-10-26 19:37:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:29,290 INFO L481 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-10-26 19:37:29,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-10-26 19:37:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:37:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:29,296 INFO L375 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] [2018-10-26 19:37:29,296 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:29,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-10-26 19:37:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:29,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:29,297 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:29,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:29,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:29,361 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-10-26 19:37:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:29,503 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-10-26 19:37:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:29,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:37:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:29,517 INFO L225 Difference]: With dead ends: 6925 [2018-10-26 19:37:29,517 INFO L226 Difference]: Without dead ends: 4683 [2018-10-26 19:37:29,521 INFO L605 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-10-26 19:37:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-10-26 19:37:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-10-26 19:37:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-10-26 19:37:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-10-26 19:37:29,630 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-10-26 19:37:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:29,630 INFO L481 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-10-26 19:37:29,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-10-26 19:37:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:37:29,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:29,636 INFO L375 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] [2018-10-26 19:37:29,636 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:29,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-10-26 19:37:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:29,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:29,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:29,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:29,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:29,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:29,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:29,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:29,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:29,705 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-10-26 19:37:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:29,887 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-10-26 19:37:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:29,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:37:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:29,903 INFO L225 Difference]: With dead ends: 8205 [2018-10-26 19:37:29,904 INFO L226 Difference]: Without dead ends: 8203 [2018-10-26 19:37:29,907 INFO L605 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-10-26 19:37:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-10-26 19:37:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-10-26 19:37:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-10-26 19:37:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-10-26 19:37:30,052 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-10-26 19:37:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:30,052 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-10-26 19:37:30,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-10-26 19:37:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:37:30,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:30,061 INFO L375 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] [2018-10-26 19:37:30,062 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:30,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-10-26 19:37:30,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:30,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:30,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:30,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:30,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:30,136 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:30,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:30,137 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-10-26 19:37:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:30,370 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-10-26 19:37:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:30,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:37:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:30,389 INFO L225 Difference]: With dead ends: 15757 [2018-10-26 19:37:30,389 INFO L226 Difference]: Without dead ends: 9099 [2018-10-26 19:37:30,401 INFO L605 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-10-26 19:37:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2018-10-26 19:37:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097. [2018-10-26 19:37:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-10-26 19:37:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 12807 transitions. [2018-10-26 19:37:30,626 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 12807 transitions. Word has length 30 [2018-10-26 19:37:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:30,626 INFO L481 AbstractCegarLoop]: Abstraction has 9097 states and 12807 transitions. [2018-10-26 19:37:30,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 12807 transitions. [2018-10-26 19:37:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:37:30,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:30,636 INFO L375 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] [2018-10-26 19:37:30,636 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:30,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:30,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1456398865, now seen corresponding path program 1 times [2018-10-26 19:37:30,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:30,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:30,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:30,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:30,709 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:30,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:30,710 INFO L87 Difference]: Start difference. First operand 9097 states and 12807 transitions. Second operand 3 states. [2018-10-26 19:37:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:30,915 INFO L93 Difference]: Finished difference Result 13645 states and 19145 transitions. [2018-10-26 19:37:30,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:30,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:37:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:30,931 INFO L225 Difference]: With dead ends: 13645 [2018-10-26 19:37:30,931 INFO L226 Difference]: Without dead ends: 9227 [2018-10-26 19:37:30,939 INFO L605 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-10-26 19:37:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-10-26 19:37:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9225. [2018-10-26 19:37:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2018-10-26 19:37:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 12807 transitions. [2018-10-26 19:37:31,112 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 12807 transitions. Word has length 31 [2018-10-26 19:37:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:31,112 INFO L481 AbstractCegarLoop]: Abstraction has 9225 states and 12807 transitions. [2018-10-26 19:37:31,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 12807 transitions. [2018-10-26 19:37:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:37:31,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:31,122 INFO L375 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] [2018-10-26 19:37:31,123 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:31,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1817500077, now seen corresponding path program 1 times [2018-10-26 19:37:31,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:31,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:31,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:31,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:31,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:31,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:31,186 INFO L87 Difference]: Start difference. First operand 9225 states and 12807 transitions. Second operand 3 states. [2018-10-26 19:37:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:31,440 INFO L93 Difference]: Finished difference Result 15885 states and 22409 transitions. [2018-10-26 19:37:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:31,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:37:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:31,465 INFO L225 Difference]: With dead ends: 15885 [2018-10-26 19:37:31,465 INFO L226 Difference]: Without dead ends: 15883 [2018-10-26 19:37:31,470 INFO L605 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-10-26 19:37:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2018-10-26 19:37:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13577. [2018-10-26 19:37:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2018-10-26 19:37:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 18311 transitions. [2018-10-26 19:37:31,724 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 18311 transitions. Word has length 31 [2018-10-26 19:37:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:31,724 INFO L481 AbstractCegarLoop]: Abstraction has 13577 states and 18311 transitions. [2018-10-26 19:37:31,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 18311 transitions. [2018-10-26 19:37:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:37:31,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:31,743 INFO L375 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] [2018-10-26 19:37:31,743 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:31,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 537636399, now seen corresponding path program 1 times [2018-10-26 19:37:31,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:31,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:31,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:31,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:31,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:31,810 INFO L87 Difference]: Start difference. First operand 13577 states and 18311 transitions. Second operand 3 states. [2018-10-26 19:37:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:32,168 INFO L93 Difference]: Finished difference Result 31245 states and 42121 transitions. [2018-10-26 19:37:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:32,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:37:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:32,195 INFO L225 Difference]: With dead ends: 31245 [2018-10-26 19:37:32,195 INFO L226 Difference]: Without dead ends: 17931 [2018-10-26 19:37:32,212 INFO L605 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-10-26 19:37:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2018-10-26 19:37:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 17929. [2018-10-26 19:37:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2018-10-26 19:37:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 23815 transitions. [2018-10-26 19:37:32,540 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 23815 transitions. Word has length 31 [2018-10-26 19:37:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:32,541 INFO L481 AbstractCegarLoop]: Abstraction has 17929 states and 23815 transitions. [2018-10-26 19:37:32,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 23815 transitions. [2018-10-26 19:37:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:37:32,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:32,554 INFO L375 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] [2018-10-26 19:37:32,554 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:32,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 508143000, now seen corresponding path program 1 times [2018-10-26 19:37:32,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:32,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:32,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:32,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:32,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:32,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:32,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:32,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:32,621 INFO L87 Difference]: Start difference. First operand 17929 states and 23815 transitions. Second operand 3 states. [2018-10-26 19:37:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:32,838 INFO L93 Difference]: Finished difference Result 26893 states and 35593 transitions. [2018-10-26 19:37:32,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:32,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:37:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:32,863 INFO L225 Difference]: With dead ends: 26893 [2018-10-26 19:37:32,863 INFO L226 Difference]: Without dead ends: 18187 [2018-10-26 19:37:32,878 INFO L605 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-10-26 19:37:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18187 states. [2018-10-26 19:37:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18187 to 18185. [2018-10-26 19:37:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2018-10-26 19:37:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 23815 transitions. [2018-10-26 19:37:33,235 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 23815 transitions. Word has length 32 [2018-10-26 19:37:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:33,235 INFO L481 AbstractCegarLoop]: Abstraction has 18185 states and 23815 transitions. [2018-10-26 19:37:33,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 23815 transitions. [2018-10-26 19:37:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:37:33,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:33,242 INFO L375 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] [2018-10-26 19:37:33,242 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:33,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash -512925354, now seen corresponding path program 1 times [2018-10-26 19:37:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:33,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:33,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:33,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:33,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:33,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:33,317 INFO L87 Difference]: Start difference. First operand 18185 states and 23815 transitions. Second operand 3 states. [2018-10-26 19:37:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:33,588 INFO L93 Difference]: Finished difference Result 30733 states and 40713 transitions. [2018-10-26 19:37:33,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:33,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:37:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:33,617 INFO L225 Difference]: With dead ends: 30733 [2018-10-26 19:37:33,617 INFO L226 Difference]: Without dead ends: 30731 [2018-10-26 19:37:33,628 INFO L605 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-10-26 19:37:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30731 states. [2018-10-26 19:37:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30731 to 27145. [2018-10-26 19:37:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27145 states. [2018-10-26 19:37:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27145 states to 27145 states and 34567 transitions. [2018-10-26 19:37:34,097 INFO L78 Accepts]: Start accepts. Automaton has 27145 states and 34567 transitions. Word has length 32 [2018-10-26 19:37:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:34,098 INFO L481 AbstractCegarLoop]: Abstraction has 27145 states and 34567 transitions. [2018-10-26 19:37:34,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27145 states and 34567 transitions. [2018-10-26 19:37:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 19:37:34,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:34,115 INFO L375 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] [2018-10-26 19:37:34,116 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:34,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1792789032, now seen corresponding path program 1 times [2018-10-26 19:37:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:34,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:34,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:34,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:34,194 INFO L87 Difference]: Start difference. First operand 27145 states and 34567 transitions. Second operand 3 states. [2018-10-26 19:37:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:34,721 INFO L93 Difference]: Finished difference Result 61965 states and 78601 transitions. [2018-10-26 19:37:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:34,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 19:37:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:34,748 INFO L225 Difference]: With dead ends: 61965 [2018-10-26 19:37:34,748 INFO L226 Difference]: Without dead ends: 35339 [2018-10-26 19:37:34,781 INFO L605 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-10-26 19:37:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2018-10-26 19:37:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 35337. [2018-10-26 19:37:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2018-10-26 19:37:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 44039 transitions. [2018-10-26 19:37:35,287 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 44039 transitions. Word has length 32 [2018-10-26 19:37:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:35,287 INFO L481 AbstractCegarLoop]: Abstraction has 35337 states and 44039 transitions. [2018-10-26 19:37:35,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 44039 transitions. [2018-10-26 19:37:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:37:35,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:35,301 INFO L375 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] [2018-10-26 19:37:35,301 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:35,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1279399012, now seen corresponding path program 1 times [2018-10-26 19:37:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:35,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:35,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:35,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:35,353 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:35,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:35,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:35,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:35,353 INFO L87 Difference]: Start difference. First operand 35337 states and 44039 transitions. Second operand 3 states. [2018-10-26 19:37:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:35,856 INFO L93 Difference]: Finished difference Result 53005 states and 65801 transitions. [2018-10-26 19:37:35,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:35,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:37:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:35,883 INFO L225 Difference]: With dead ends: 53005 [2018-10-26 19:37:35,883 INFO L226 Difference]: Without dead ends: 35851 [2018-10-26 19:37:35,897 INFO L605 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-10-26 19:37:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35851 states. [2018-10-26 19:37:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35851 to 35849. [2018-10-26 19:37:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35849 states. [2018-10-26 19:37:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 44039 transitions. [2018-10-26 19:37:36,373 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 44039 transitions. Word has length 33 [2018-10-26 19:37:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:36,374 INFO L481 AbstractCegarLoop]: Abstraction has 35849 states and 44039 transitions. [2018-10-26 19:37:36,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 44039 transitions. [2018-10-26 19:37:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:37:36,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:36,388 INFO L375 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] [2018-10-26 19:37:36,388 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:36,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:36,388 INFO L82 PathProgramCache]: Analyzing trace with hash 258330658, now seen corresponding path program 1 times [2018-10-26 19:37:36,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:36,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:36,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:36,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:36,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:36,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:36,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:36,429 INFO L87 Difference]: Start difference. First operand 35849 states and 44039 transitions. Second operand 3 states. [2018-10-26 19:37:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:37,260 INFO L93 Difference]: Finished difference Result 59405 states and 73225 transitions. [2018-10-26 19:37:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:37,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:37:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:37,299 INFO L225 Difference]: With dead ends: 59405 [2018-10-26 19:37:37,299 INFO L226 Difference]: Without dead ends: 59403 [2018-10-26 19:37:37,304 INFO L605 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-10-26 19:37:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-10-26 19:37:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 54281. [2018-10-26 19:37:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54281 states. [2018-10-26 19:37:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 65031 transitions. [2018-10-26 19:37:37,910 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 65031 transitions. Word has length 33 [2018-10-26 19:37:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:37,910 INFO L481 AbstractCegarLoop]: Abstraction has 54281 states and 65031 transitions. [2018-10-26 19:37:37,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 65031 transitions. [2018-10-26 19:37:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 19:37:37,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:37,947 INFO L375 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] [2018-10-26 19:37:37,947 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1021533020, now seen corresponding path program 1 times [2018-10-26 19:37:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:37,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:37,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:38,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:38,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:38,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:38,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:38,025 INFO L87 Difference]: Start difference. First operand 54281 states and 65031 transitions. Second operand 3 states. [2018-10-26 19:37:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:38,989 INFO L93 Difference]: Finished difference Result 122893 states and 145929 transitions. [2018-10-26 19:37:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:38,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-26 19:37:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:39,037 INFO L225 Difference]: With dead ends: 122893 [2018-10-26 19:37:39,037 INFO L226 Difference]: Without dead ends: 69643 [2018-10-26 19:37:39,068 INFO L605 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-10-26 19:37:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69643 states. [2018-10-26 19:37:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69643 to 69641. [2018-10-26 19:37:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69641 states. [2018-10-26 19:37:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69641 states to 69641 states and 80903 transitions. [2018-10-26 19:37:40,045 INFO L78 Accepts]: Start accepts. Automaton has 69641 states and 80903 transitions. Word has length 33 [2018-10-26 19:37:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:40,045 INFO L481 AbstractCegarLoop]: Abstraction has 69641 states and 80903 transitions. [2018-10-26 19:37:40,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 69641 states and 80903 transitions. [2018-10-26 19:37:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:37:40,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:40,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:37:40,075 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:40,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -581468051, now seen corresponding path program 1 times [2018-10-26 19:37:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:40,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:40,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:40,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:40,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:40,137 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:40,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:40,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:40,137 INFO L87 Difference]: Start difference. First operand 69641 states and 80903 transitions. Second operand 3 states. [2018-10-26 19:37:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:41,136 INFO L93 Difference]: Finished difference Result 104461 states and 120841 transitions. [2018-10-26 19:37:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:41,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:37:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:41,193 INFO L225 Difference]: With dead ends: 104461 [2018-10-26 19:37:41,193 INFO L226 Difference]: Without dead ends: 70667 [2018-10-26 19:37:41,216 INFO L605 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-10-26 19:37:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70667 states. [2018-10-26 19:37:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70667 to 70665. [2018-10-26 19:37:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70665 states. [2018-10-26 19:37:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70665 states to 70665 states and 80903 transitions. [2018-10-26 19:37:42,127 INFO L78 Accepts]: Start accepts. Automaton has 70665 states and 80903 transitions. Word has length 34 [2018-10-26 19:37:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:42,127 INFO L481 AbstractCegarLoop]: Abstraction has 70665 states and 80903 transitions. [2018-10-26 19:37:42,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 70665 states and 80903 transitions. [2018-10-26 19:37:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:37:42,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:42,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:37:42,155 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:42,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1602536405, now seen corresponding path program 1 times [2018-10-26 19:37:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:42,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:42,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:42,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:42,224 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:42,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:42,225 INFO L87 Difference]: Start difference. First operand 70665 states and 80903 transitions. Second operand 3 states. [2018-10-26 19:37:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:43,801 INFO L93 Difference]: Finished difference Result 114699 states and 130056 transitions. [2018-10-26 19:37:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:43,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:37:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:43,897 INFO L225 Difference]: With dead ends: 114699 [2018-10-26 19:37:43,897 INFO L226 Difference]: Without dead ends: 114697 [2018-10-26 19:37:43,910 INFO L605 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-10-26 19:37:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114697 states. [2018-10-26 19:37:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114697 to 108553. [2018-10-26 19:37:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108553 states. [2018-10-26 19:37:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108553 states to 108553 states and 121863 transitions. [2018-10-26 19:37:45,160 INFO L78 Accepts]: Start accepts. Automaton has 108553 states and 121863 transitions. Word has length 34 [2018-10-26 19:37:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:45,160 INFO L481 AbstractCegarLoop]: Abstraction has 108553 states and 121863 transitions. [2018-10-26 19:37:45,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 108553 states and 121863 transitions. [2018-10-26 19:37:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:37:45,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:45,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:37:45,220 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:45,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1412567213, now seen corresponding path program 1 times [2018-10-26 19:37:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:37:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:45,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:45,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:37:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:37:45,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:37:45,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:37:45,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:37:45,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:37:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:37:45,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:37:45,289 INFO L87 Difference]: Start difference. First operand 108553 states and 121863 transitions. Second operand 3 states. [2018-10-26 19:37:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:47,153 INFO L93 Difference]: Finished difference Result 243721 states and 269319 transitions. [2018-10-26 19:37:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:37:47,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 19:37:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:47,154 INFO L225 Difference]: With dead ends: 243721 [2018-10-26 19:37:47,154 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:37:47,279 INFO L605 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-10-26 19:37:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:37:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:37:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:37:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:37:47,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-10-26 19:37:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:47,280 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:37:47,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:37:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:37:47,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:37:47,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:37:47,418 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:37:47,418 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:37:47,418 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-10-26 19:37:47,418 INFO L425 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-26 19:37:47,419 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-10-26 19:37:47,420 INFO L428 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,420 INFO L428 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-10-26 19:37:47,421 INFO L425 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-10-26 19:37:47,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:37:47 BoogieIcfgContainer [2018-10-26 19:37:47,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:37:47,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:37:47,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:37:47,428 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:37:47,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:37:25" (3/4) ... [2018-10-26 19:37:47,432 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:37:47,439 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:37:47,440 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:37:47,446 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 19:37:47,447 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 19:37:47,447 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:37:47,512 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_28beed27-5d3e-4729-b90d-79aac90ed5de/bin-2019/utaipan/witness.graphml [2018-10-26 19:37:47,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:37:47,519 INFO L168 Benchmark]: Toolchain (without parser) took 23221.19 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 953.1 MB in the beginning and 1.6 GB in the end (delta: -690.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,521 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:37:47,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.21 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.48 ms. Allocated memory is still 1.0 GB. Free memory was 942.2 MB in the beginning and 939.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,521 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 1.0 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:37:47,522 INFO L168 Benchmark]: RCFGBuilder took 672.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.5 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,522 INFO L168 Benchmark]: TraceAbstraction took 22212.79 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -521.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,522 INFO L168 Benchmark]: Witness Printer took 91.34 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 613.9 kB). Peak memory consumption was 613.9 kB. Max. memory is 11.5 GB. [2018-10-26 19:37:47,528 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.21 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.48 ms. Allocated memory is still 1.0 GB. Free memory was 942.2 MB in the beginning and 939.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 1.0 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 672.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.5 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22212.79 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -521.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 91.34 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 613.9 kB). Peak memory consumption was 613.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 22.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3487 SDtfs, 1713 SDslu, 2374 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108553occurred in iteration=33, 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: 7.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 20515 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 53057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...