/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:38,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:38,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:38,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:38,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:38,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:38,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:38,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:38,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:38,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:38,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:38,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:38,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:38,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:38,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:38,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:38,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:38,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:38,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:38,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:38,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:38,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:38,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:38,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:38,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:38,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:38,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:38,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:38,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:38,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:38,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:38,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:38,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:38,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:38,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:38,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:38,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:38,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:38,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:38,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:38,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:38,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:35:38,656 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:38,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:38,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:38,657 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:38,657 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:38,657 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:38,658 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:38,658 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:38,658 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:38,658 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:38,658 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:38,659 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:38,659 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:38,659 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:38,659 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:38,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:38,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:38,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:38,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:38,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:38,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:38,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:38,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:38,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:38,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:38,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:38,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:38,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:38,663 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:38,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:38,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:38,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:38,664 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:35:38,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:35:38,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:35:38,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:35:38,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:35:38,961 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:35:38,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-11-23 23:35:39,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b3f58f/11a5c6f98d3342baa6da28772fbecf88/FLAGccc3e85c3 [2019-11-23 23:35:39,670 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:39,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label39.c [2019-11-23 23:35:39,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b3f58f/11a5c6f98d3342baa6da28772fbecf88/FLAGccc3e85c3 [2019-11-23 23:35:39,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b3f58f/11a5c6f98d3342baa6da28772fbecf88 [2019-11-23 23:35:39,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:39,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:39,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:39,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:39,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:39,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:39" (1/1) ... [2019-11-23 23:35:39,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5088ba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:39, skipping insertion in model container [2019-11-23 23:35:39,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:39" (1/1) ... [2019-11-23 23:35:39,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:39,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:40,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:40,770 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:41,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:41,242 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:41,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41 WrapperNode [2019-11-23 23:35:41,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:41,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:41,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:41,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:41,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:41,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:41,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:41,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:41,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... [2019-11-23 23:35:41,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:41,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:41,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:41,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:41,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-23 23:35:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:41,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:44,467 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:44,467 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:44,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:44 BoogieIcfgContainer [2019-11-23 23:35:44,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:44,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:44,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:44,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:44,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:39" (1/3) ... [2019-11-23 23:35:44,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4823f8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:44, skipping insertion in model container [2019-11-23 23:35:44,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:41" (2/3) ... [2019-11-23 23:35:44,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4823f8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:44, skipping insertion in model container [2019-11-23 23:35:44,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:44" (3/3) ... [2019-11-23 23:35:44,476 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2019-11-23 23:35:44,486 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:44,493 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:44,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:44,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:44,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:44,533 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:44,533 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:44,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:44,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:44,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:44,534 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:44,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:44,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:44,571 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1467463659, now seen corresponding path program 1 times [2019-11-23 23:35:44,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:44,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059896998] [2019-11-23 23:35:44,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059896998] [2019-11-23 23:35:45,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:45,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:45,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633854227] [2019-11-23 23:35:45,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:45,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:45,297 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:35:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:46,805 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:35:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:46,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:35:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:46,829 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:35:46,829 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:35:46,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:35:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:35:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:35:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 555 transitions. [2019-11-23 23:35:46,906 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 555 transitions. Word has length 143 [2019-11-23 23:35:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:46,907 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 555 transitions. [2019-11-23 23:35:46,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 555 transitions. [2019-11-23 23:35:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 23:35:46,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:46,912 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:46,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:46,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2003094212, now seen corresponding path program 1 times [2019-11-23 23:35:46,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:46,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520581780] [2019-11-23 23:35:46,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:47,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520581780] [2019-11-23 23:35:47,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:47,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:47,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115165042] [2019-11-23 23:35:47,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:47,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:47,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:47,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:47,020 INFO L87 Difference]: Start difference. First operand 289 states and 555 transitions. Second operand 3 states. [2019-11-23 23:35:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:47,992 INFO L93 Difference]: Finished difference Result 865 states and 1663 transitions. [2019-11-23 23:35:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:47,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 23:35:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:47,996 INFO L225 Difference]: With dead ends: 865 [2019-11-23 23:35:47,997 INFO L226 Difference]: Without dead ends: 577 [2019-11-23 23:35:47,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-23 23:35:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-11-23 23:35:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:35:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1008 transitions. [2019-11-23 23:35:48,041 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1008 transitions. Word has length 147 [2019-11-23 23:35:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:48,042 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1008 transitions. [2019-11-23 23:35:48,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1008 transitions. [2019-11-23 23:35:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:35:48,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:48,048 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:48,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1977890636, now seen corresponding path program 1 times [2019-11-23 23:35:48,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:48,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28085406] [2019-11-23 23:35:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:48,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28085406] [2019-11-23 23:35:48,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:48,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:48,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7542437] [2019-11-23 23:35:48,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:48,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:48,133 INFO L87 Difference]: Start difference. First operand 575 states and 1008 transitions. Second operand 3 states. [2019-11-23 23:35:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:49,186 INFO L93 Difference]: Finished difference Result 1721 states and 3021 transitions. [2019-11-23 23:35:49,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:49,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:35:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:49,195 INFO L225 Difference]: With dead ends: 1721 [2019-11-23 23:35:49,195 INFO L226 Difference]: Without dead ends: 1147 [2019-11-23 23:35:49,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-11-23 23:35:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2019-11-23 23:35:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:35:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1966 transitions. [2019-11-23 23:35:49,242 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1966 transitions. Word has length 151 [2019-11-23 23:35:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:49,242 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1966 transitions. [2019-11-23 23:35:49,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1966 transitions. [2019-11-23 23:35:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 23:35:49,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:49,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:49,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:49,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1787652817, now seen corresponding path program 1 times [2019-11-23 23:35:49,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:49,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925062865] [2019-11-23 23:35:49,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:49,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925062865] [2019-11-23 23:35:49,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:49,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:49,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316560498] [2019-11-23 23:35:49,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:49,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:49,376 INFO L87 Difference]: Start difference. First operand 1147 states and 1966 transitions. Second operand 3 states. [2019-11-23 23:35:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:50,303 INFO L93 Difference]: Finished difference Result 2865 states and 4889 transitions. [2019-11-23 23:35:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:50,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 23:35:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:50,314 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:35:50,314 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:35:50,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:35:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:35:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:35:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2864 transitions. [2019-11-23 23:35:50,364 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2864 transitions. Word has length 153 [2019-11-23 23:35:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:50,364 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2864 transitions. [2019-11-23 23:35:50,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2864 transitions. [2019-11-23 23:35:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:35:50,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:50,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:50,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash 351566833, now seen corresponding path program 1 times [2019-11-23 23:35:50,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:50,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553068773] [2019-11-23 23:35:50,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553068773] [2019-11-23 23:35:50,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:50,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:50,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765364860] [2019-11-23 23:35:50,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:50,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:50,575 INFO L87 Difference]: Start difference. First operand 1719 states and 2864 transitions. Second operand 3 states. [2019-11-23 23:35:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:51,593 INFO L93 Difference]: Finished difference Result 4295 states and 7288 transitions. [2019-11-23 23:35:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:51,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:35:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:51,608 INFO L225 Difference]: With dead ends: 4295 [2019-11-23 23:35:51,608 INFO L226 Difference]: Without dead ends: 2577 [2019-11-23 23:35:51,611 INFO L630 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 [2019-11-23 23:35:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2019-11-23 23:35:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2291. [2019-11-23 23:35:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-11-23 23:35:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3759 transitions. [2019-11-23 23:35:51,669 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3759 transitions. Word has length 158 [2019-11-23 23:35:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:51,670 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3759 transitions. [2019-11-23 23:35:51,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3759 transitions. [2019-11-23 23:35:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 23:35:51,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:51,676 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:51,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -856986324, now seen corresponding path program 1 times [2019-11-23 23:35:51,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:51,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460545000] [2019-11-23 23:35:51,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:51,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460545000] [2019-11-23 23:35:51,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107256176] [2019-11-23 23:35:51,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:52,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:52,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:52,183 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:52,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:52,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:52,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705611875] [2019-11-23 23:35:52,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:52,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:52,230 INFO L87 Difference]: Start difference. First operand 2291 states and 3759 transitions. Second operand 3 states. [2019-11-23 23:35:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:53,227 INFO L93 Difference]: Finished difference Result 6869 states and 11274 transitions. [2019-11-23 23:35:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:53,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 23:35:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:53,252 INFO L225 Difference]: With dead ends: 6869 [2019-11-23 23:35:53,252 INFO L226 Difference]: Without dead ends: 4579 [2019-11-23 23:35:53,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-11-23 23:35:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-11-23 23:35:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-23 23:35:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 7073 transitions. [2019-11-23 23:35:53,382 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 7073 transitions. Word has length 160 [2019-11-23 23:35:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:53,383 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 7073 transitions. [2019-11-23 23:35:53,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 7073 transitions. [2019-11-23 23:35:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 23:35:53,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:53,403 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:53,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:53,607 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -272245503, now seen corresponding path program 1 times [2019-11-23 23:35:53,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:53,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485720797] [2019-11-23 23:35:53,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 23:35:53,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485720797] [2019-11-23 23:35:53,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314067138] [2019-11-23 23:35:53,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:53,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:53,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:53,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:35:53,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:53,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:35:53,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270504777] [2019-11-23 23:35:53,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:53,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:53,972 INFO L87 Difference]: Start difference. First operand 4579 states and 7073 transitions. Second operand 3 states. [2019-11-23 23:35:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:54,425 INFO L93 Difference]: Finished difference Result 13735 states and 21217 transitions. [2019-11-23 23:35:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:54,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 23:35:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:54,475 INFO L225 Difference]: With dead ends: 13735 [2019-11-23 23:35:54,476 INFO L226 Difference]: Without dead ends: 9157 [2019-11-23 23:35:54,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2019-11-23 23:35:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 9155. [2019-11-23 23:35:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2019-11-23 23:35:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 14064 transitions. [2019-11-23 23:35:54,709 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 14064 transitions. Word has length 172 [2019-11-23 23:35:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:54,710 INFO L462 AbstractCegarLoop]: Abstraction has 9155 states and 14064 transitions. [2019-11-23 23:35:54,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 14064 transitions. [2019-11-23 23:35:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 23:35:54,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:54,723 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:54,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:54,928 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1995411298, now seen corresponding path program 1 times [2019-11-23 23:35:54,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:54,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436545008] [2019-11-23 23:35:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:55,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436545008] [2019-11-23 23:35:55,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:55,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:55,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274518830] [2019-11-23 23:35:55,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:55,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:55,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:55,025 INFO L87 Difference]: Start difference. First operand 9155 states and 14064 transitions. Second operand 3 states. [2019-11-23 23:35:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:56,017 INFO L93 Difference]: Finished difference Result 22456 states and 34834 transitions. [2019-11-23 23:35:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:56,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 23:35:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:56,079 INFO L225 Difference]: With dead ends: 22456 [2019-11-23 23:35:56,080 INFO L226 Difference]: Without dead ends: 13302 [2019-11-23 23:35:56,094 INFO L630 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 [2019-11-23 23:35:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13302 states. [2019-11-23 23:35:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13302 to 13302. [2019-11-23 23:35:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13302 states. [2019-11-23 23:35:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13302 states to 13302 states and 19686 transitions. [2019-11-23 23:35:56,356 INFO L78 Accepts]: Start accepts. Automaton has 13302 states and 19686 transitions. Word has length 173 [2019-11-23 23:35:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:56,356 INFO L462 AbstractCegarLoop]: Abstraction has 13302 states and 19686 transitions. [2019-11-23 23:35:56,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13302 states and 19686 transitions. [2019-11-23 23:35:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 23:35:56,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:56,375 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:56,375 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 338724563, now seen corresponding path program 1 times [2019-11-23 23:35:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675303764] [2019-11-23 23:35:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 23:35:56,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675303764] [2019-11-23 23:35:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:56,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865401125] [2019-11-23 23:35:56,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:56,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:56,479 INFO L87 Difference]: Start difference. First operand 13302 states and 19686 transitions. Second operand 3 states. [2019-11-23 23:35:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:57,640 INFO L93 Difference]: Finished difference Result 38043 states and 56217 transitions. [2019-11-23 23:35:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:57,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 23:35:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:57,689 INFO L225 Difference]: With dead ends: 38043 [2019-11-23 23:35:57,689 INFO L226 Difference]: Without dead ends: 24742 [2019-11-23 23:35:57,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24742 states. [2019-11-23 23:35:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24742 to 20166. [2019-11-23 23:35:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20166 states. [2019-11-23 23:35:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20166 states to 20166 states and 26942 transitions. [2019-11-23 23:35:58,100 INFO L78 Accepts]: Start accepts. Automaton has 20166 states and 26942 transitions. Word has length 177 [2019-11-23 23:35:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:58,101 INFO L462 AbstractCegarLoop]: Abstraction has 20166 states and 26942 transitions. [2019-11-23 23:35:58,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 20166 states and 26942 transitions. [2019-11-23 23:35:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 23:35:58,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:58,123 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:58,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:58,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1004517805, now seen corresponding path program 1 times [2019-11-23 23:35:58,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:58,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503187873] [2019-11-23 23:35:58,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:58,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503187873] [2019-11-23 23:35:58,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:58,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:58,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960522997] [2019-11-23 23:35:58,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:58,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:58,223 INFO L87 Difference]: Start difference. First operand 20166 states and 26942 transitions. Second operand 4 states. [2019-11-23 23:35:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:59,945 INFO L93 Difference]: Finished difference Result 49483 states and 67283 transitions. [2019-11-23 23:35:59,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:59,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-23 23:35:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:59,989 INFO L225 Difference]: With dead ends: 49483 [2019-11-23 23:35:59,989 INFO L226 Difference]: Without dead ends: 29318 [2019-11-23 23:36:00,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29318 states. [2019-11-23 23:36:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29318 to 29318. [2019-11-23 23:36:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29318 states. [2019-11-23 23:36:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29318 states to 29318 states and 36879 transitions. [2019-11-23 23:36:00,448 INFO L78 Accepts]: Start accepts. Automaton has 29318 states and 36879 transitions. Word has length 187 [2019-11-23 23:36:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:00,449 INFO L462 AbstractCegarLoop]: Abstraction has 29318 states and 36879 transitions. [2019-11-23 23:36:00,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29318 states and 36879 transitions. [2019-11-23 23:36:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-23 23:36:00,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:00,483 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:00,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -532230129, now seen corresponding path program 1 times [2019-11-23 23:36:00,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:00,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632578045] [2019-11-23 23:36:00,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 23:36:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632578045] [2019-11-23 23:36:00,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:00,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:00,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163544912] [2019-11-23 23:36:00,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:00,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:00,728 INFO L87 Difference]: Start difference. First operand 29318 states and 36879 transitions. Second operand 3 states. [2019-11-23 23:36:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:01,333 INFO L93 Difference]: Finished difference Result 54059 states and 67887 transitions. [2019-11-23 23:36:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:01,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-23 23:36:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:01,360 INFO L225 Difference]: With dead ends: 54059 [2019-11-23 23:36:01,361 INFO L226 Difference]: Without dead ends: 24742 [2019-11-23 23:36:01,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24742 states. [2019-11-23 23:36:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24742 to 24742. [2019-11-23 23:36:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24742 states. [2019-11-23 23:36:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24742 states to 24742 states and 30331 transitions. [2019-11-23 23:36:01,759 INFO L78 Accepts]: Start accepts. Automaton has 24742 states and 30331 transitions. Word has length 199 [2019-11-23 23:36:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:01,759 INFO L462 AbstractCegarLoop]: Abstraction has 24742 states and 30331 transitions. [2019-11-23 23:36:01,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24742 states and 30331 transitions. [2019-11-23 23:36:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-23 23:36:01,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:01,794 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:01,794 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1360492538, now seen corresponding path program 1 times [2019-11-23 23:36:01,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:01,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084354385] [2019-11-23 23:36:01,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:36:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084354385] [2019-11-23 23:36:01,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:01,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517923767] [2019-11-23 23:36:01,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:01,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:01,995 INFO L87 Difference]: Start difference. First operand 24742 states and 30331 transitions. Second operand 4 states. [2019-11-23 23:36:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:04,224 INFO L93 Difference]: Finished difference Result 56633 states and 68895 transitions. [2019-11-23 23:36:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:04,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-11-23 23:36:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:04,252 INFO L225 Difference]: With dead ends: 56633 [2019-11-23 23:36:04,252 INFO L226 Difference]: Without dead ends: 31892 [2019-11-23 23:36:04,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31892 states. [2019-11-23 23:36:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31892 to 31320. [2019-11-23 23:36:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31320 states. [2019-11-23 23:36:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31320 states to 31320 states and 37571 transitions. [2019-11-23 23:36:04,681 INFO L78 Accepts]: Start accepts. Automaton has 31320 states and 37571 transitions. Word has length 258 [2019-11-23 23:36:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:04,682 INFO L462 AbstractCegarLoop]: Abstraction has 31320 states and 37571 transitions. [2019-11-23 23:36:04,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31320 states and 37571 transitions. [2019-11-23 23:36:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:36:04,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:04,709 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:04,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1796658209, now seen corresponding path program 1 times [2019-11-23 23:36:04,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:04,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945536991] [2019-11-23 23:36:04,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:05,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945536991] [2019-11-23 23:36:05,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:05,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:05,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127944668] [2019-11-23 23:36:05,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:05,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:05,180 INFO L87 Difference]: Start difference. First operand 31320 states and 37571 transitions. Second operand 4 states. [2019-11-23 23:36:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:06,608 INFO L93 Difference]: Finished difference Result 68645 states and 82188 transitions. [2019-11-23 23:36:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:06,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2019-11-23 23:36:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:06,641 INFO L225 Difference]: With dead ends: 68645 [2019-11-23 23:36:06,641 INFO L226 Difference]: Without dead ends: 37326 [2019-11-23 23:36:06,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37326 states. [2019-11-23 23:36:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37326 to 32178. [2019-11-23 23:36:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32178 states. [2019-11-23 23:36:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32178 states to 32178 states and 38650 transitions. [2019-11-23 23:36:07,279 INFO L78 Accepts]: Start accepts. Automaton has 32178 states and 38650 transitions. Word has length 271 [2019-11-23 23:36:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:07,280 INFO L462 AbstractCegarLoop]: Abstraction has 32178 states and 38650 transitions. [2019-11-23 23:36:07,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32178 states and 38650 transitions. [2019-11-23 23:36:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-23 23:36:07,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:07,298 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:07,298 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash -701417080, now seen corresponding path program 1 times [2019-11-23 23:36:07,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:07,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033235096] [2019-11-23 23:36:07,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:07,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033235096] [2019-11-23 23:36:07,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:07,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:07,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382586174] [2019-11-23 23:36:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:07,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:07,538 INFO L87 Difference]: Start difference. First operand 32178 states and 38650 transitions. Second operand 3 states. [2019-11-23 23:36:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:08,568 INFO L93 Difference]: Finished difference Result 69217 states and 83410 transitions. [2019-11-23 23:36:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:08,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-11-23 23:36:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:08,613 INFO L225 Difference]: With dead ends: 69217 [2019-11-23 23:36:08,614 INFO L226 Difference]: Without dead ends: 37040 [2019-11-23 23:36:08,635 INFO L630 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 [2019-11-23 23:36:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37040 states. [2019-11-23 23:36:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37040 to 34895. [2019-11-23 23:36:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34895 states. [2019-11-23 23:36:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34895 states to 34895 states and 42081 transitions. [2019-11-23 23:36:10,234 INFO L78 Accepts]: Start accepts. Automaton has 34895 states and 42081 transitions. Word has length 290 [2019-11-23 23:36:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:10,237 INFO L462 AbstractCegarLoop]: Abstraction has 34895 states and 42081 transitions. [2019-11-23 23:36:10,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34895 states and 42081 transitions. [2019-11-23 23:36:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 23:36:10,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:10,258 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:10,258 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -565730799, now seen corresponding path program 1 times [2019-11-23 23:36:10,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:10,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869402749] [2019-11-23 23:36:10,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:36:10,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869402749] [2019-11-23 23:36:10,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:10,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:10,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508093153] [2019-11-23 23:36:10,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:10,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:10,731 INFO L87 Difference]: Start difference. First operand 34895 states and 42081 transitions. Second operand 5 states. [2019-11-23 23:36:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:12,145 INFO L93 Difference]: Finished difference Result 99821 states and 120023 transitions. [2019-11-23 23:36:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:12,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-11-23 23:36:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:12,230 INFO L225 Difference]: With dead ends: 99821 [2019-11-23 23:36:12,230 INFO L226 Difference]: Without dead ends: 64927 [2019-11-23 23:36:12,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64927 states. [2019-11-23 23:36:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64927 to 64639. [2019-11-23 23:36:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64639 states. [2019-11-23 23:36:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64639 states to 64639 states and 77540 transitions. [2019-11-23 23:36:13,023 INFO L78 Accepts]: Start accepts. Automaton has 64639 states and 77540 transitions. Word has length 292 [2019-11-23 23:36:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:13,023 INFO L462 AbstractCegarLoop]: Abstraction has 64639 states and 77540 transitions. [2019-11-23 23:36:13,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64639 states and 77540 transitions. [2019-11-23 23:36:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-23 23:36:13,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:13,047 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:13,047 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:13,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1643329907, now seen corresponding path program 1 times [2019-11-23 23:36:13,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:13,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307402295] [2019-11-23 23:36:13,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 154 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:14,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307402295] [2019-11-23 23:36:14,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160499728] [2019-11-23 23:36:14,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:36:14,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-23 23:36:14,480 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-23 23:36:14,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:14,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-23 23:36:14,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423656782] [2019-11-23 23:36:14,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:14,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:36:14,531 INFO L87 Difference]: Start difference. First operand 64639 states and 77540 transitions. Second operand 3 states. [2019-11-23 23:36:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:15,803 INFO L93 Difference]: Finished difference Result 158306 states and 190185 transitions. [2019-11-23 23:36:15,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:15,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-23 23:36:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:15,892 INFO L225 Difference]: With dead ends: 158306 [2019-11-23 23:36:15,893 INFO L226 Difference]: Without dead ends: 93668 [2019-11-23 23:36:15,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 593 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:36:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93668 states. [2019-11-23 23:36:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93668 to 87376. [2019-11-23 23:36:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87376 states. [2019-11-23 23:36:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87376 states to 87376 states and 103731 transitions. [2019-11-23 23:36:17,077 INFO L78 Accepts]: Start accepts. Automaton has 87376 states and 103731 transitions. Word has length 298 [2019-11-23 23:36:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:17,077 INFO L462 AbstractCegarLoop]: Abstraction has 87376 states and 103731 transitions. [2019-11-23 23:36:17,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 87376 states and 103731 transitions. [2019-11-23 23:36:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-23 23:36:17,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:17,110 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:17,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:17,314 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash -60476995, now seen corresponding path program 1 times [2019-11-23 23:36:17,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:17,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366756974] [2019-11-23 23:36:17,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:17,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366756974] [2019-11-23 23:36:17,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528808520] [2019-11-23 23:36:17,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:17,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:17,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:17,852 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 159 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:17,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231491220] [2019-11-23 23:36:17,986 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:36:17,986 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:36:17,995 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:36:18,004 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:36:18,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:36:58,129 INFO L180 IcfgInterpreter]: Interpretation finished