/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:46:27,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:46:27,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:46:27,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:46:27,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:46:27,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:46:27,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:46:27,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:46:27,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:46:27,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:46:27,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:46:27,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:46:27,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:46:27,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:46:27,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:46:27,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:46:27,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:46:27,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:46:27,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:46:27,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:46:27,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:46:27,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:46:27,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:46:27,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:46:27,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:46:27,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:46:27,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:46:27,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:46:27,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:46:27,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:46:27,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:46:27,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:46:27,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:46:27,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:46:27,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:46:27,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:46:27,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:46:27,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:46:27,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:46:27,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:46:27,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:46:27,423 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-24 05:46:27,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:46:27,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:46:27,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:46:27,448 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:46:27,448 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:46:27,448 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:46:27,448 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:46:27,449 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:46:27,449 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:46:27,449 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:46:27,449 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:46:27,449 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:46:27,450 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:46:27,450 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:46:27,450 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:46:27,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:46:27,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:46:27,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:46:27,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:46:27,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:46:27,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:46:27,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:46:27,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:46:27,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:46:27,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:46:27,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:46:27,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:46:27,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:46:27,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:46:27,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:27,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:46:27,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:46:27,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:46:27,454 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:46:27,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:46:27,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:46:27,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:46:27,455 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:46:27,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:46:27,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:46:27,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:46:27,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:46:27,793 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:46:27,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:46:27,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b346eeb/b24c6c3ccd7b451ca18e44b8f58f150f/FLAG39c237cbc [2019-11-24 05:46:28,373 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:46:28,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:46:28,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b346eeb/b24c6c3ccd7b451ca18e44b8f58f150f/FLAG39c237cbc [2019-11-24 05:46:28,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b346eeb/b24c6c3ccd7b451ca18e44b8f58f150f [2019-11-24 05:46:28,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:46:28,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:46:28,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:28,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:46:28,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:46:28,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:28" (1/1) ... [2019-11-24 05:46:28,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207479fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:28, skipping insertion in model container [2019-11-24 05:46:28,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:28" (1/1) ... [2019-11-24 05:46:28,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:46:28,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:46:29,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:29,165 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:46:29,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:29,278 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:46:29,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29 WrapperNode [2019-11-24 05:46:29,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:29,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:29,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:46:29,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:46:29,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:29,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:46:29,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:46:29,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:46:29,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:46:29,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:46:29,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:46:29,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:46:29,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (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-24 05:46:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:46:29,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:46:30,703 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:46:30,704 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:46:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:30 BoogieIcfgContainer [2019-11-24 05:46:30,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:46:30,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:46:30,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:46:30,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:46:30,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:46:28" (1/3) ... [2019-11-24 05:46:30,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4969855a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:30, skipping insertion in model container [2019-11-24 05:46:30,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (2/3) ... [2019-11-24 05:46:30,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4969855a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:30, skipping insertion in model container [2019-11-24 05:46:30,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:30" (3/3) ... [2019-11-24 05:46:30,714 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-24 05:46:30,724 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:46:30,732 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 05:46:30,744 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 05:46:30,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:46:30,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:46:30,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:46:30,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:46:30,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:46:30,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:46:30,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:46:30,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:46:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-24 05:46:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:46:30,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:30,806 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] [2019-11-24 05:46:30,807 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1373817152, now seen corresponding path program 1 times [2019-11-24 05:46:30,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:30,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809236305] [2019-11-24 05:46:30,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:31,300 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-24 05:46:31,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809236305] [2019-11-24 05:46:31,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:31,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:46:31,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204768224] [2019-11-24 05:46:31,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:31,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:31,330 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 5 states. [2019-11-24 05:46:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:31,599 INFO L93 Difference]: Finished difference Result 295 states and 472 transitions. [2019-11-24 05:46:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:31,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-24 05:46:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:31,614 INFO L225 Difference]: With dead ends: 295 [2019-11-24 05:46:31,615 INFO L226 Difference]: Without dead ends: 221 [2019-11-24 05:46:31,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-24 05:46:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2019-11-24 05:46:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-24 05:46:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 285 transitions. [2019-11-24 05:46:31,702 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 285 transitions. Word has length 42 [2019-11-24 05:46:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:31,703 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 285 transitions. [2019-11-24 05:46:31,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 285 transitions. [2019-11-24 05:46:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:46:31,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:31,706 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] [2019-11-24 05:46:31,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1241651541, now seen corresponding path program 1 times [2019-11-24 05:46:31,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:31,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551446412] [2019-11-24 05:46:31,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:31,862 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-24 05:46:31,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551446412] [2019-11-24 05:46:31,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:31,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:31,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413367401] [2019-11-24 05:46:31,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:31,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:31,871 INFO L87 Difference]: Start difference. First operand 217 states and 285 transitions. Second operand 5 states. [2019-11-24 05:46:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:32,151 INFO L93 Difference]: Finished difference Result 487 states and 653 transitions. [2019-11-24 05:46:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:32,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 05:46:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:32,156 INFO L225 Difference]: With dead ends: 487 [2019-11-24 05:46:32,156 INFO L226 Difference]: Without dead ends: 311 [2019-11-24 05:46:32,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-24 05:46:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-11-24 05:46:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-24 05:46:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 410 transitions. [2019-11-24 05:46:32,226 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 410 transitions. Word has length 43 [2019-11-24 05:46:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:32,227 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 410 transitions. [2019-11-24 05:46:32,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 410 transitions. [2019-11-24 05:46:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:46:32,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:32,236 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] [2019-11-24 05:46:32,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1749121508, now seen corresponding path program 1 times [2019-11-24 05:46:32,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:32,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134350416] [2019-11-24 05:46:32,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:32,363 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-24 05:46:32,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134350416] [2019-11-24 05:46:32,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:32,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:32,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123655548] [2019-11-24 05:46:32,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:32,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:32,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:32,368 INFO L87 Difference]: Start difference. First operand 309 states and 410 transitions. Second operand 5 states. [2019-11-24 05:46:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:32,600 INFO L93 Difference]: Finished difference Result 738 states and 1002 transitions. [2019-11-24 05:46:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:32,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 05:46:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:32,608 INFO L225 Difference]: With dead ends: 738 [2019-11-24 05:46:32,609 INFO L226 Difference]: Without dead ends: 495 [2019-11-24 05:46:32,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-24 05:46:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-11-24 05:46:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-24 05:46:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 657 transitions. [2019-11-24 05:46:32,678 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 657 transitions. Word has length 43 [2019-11-24 05:46:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:32,679 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 657 transitions. [2019-11-24 05:46:32,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 657 transitions. [2019-11-24 05:46:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 05:46:32,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:32,682 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] [2019-11-24 05:46:32,682 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2023643670, now seen corresponding path program 1 times [2019-11-24 05:46:32,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:32,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189617211] [2019-11-24 05:46:32,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:32,763 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-24 05:46:32,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189617211] [2019-11-24 05:46:32,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:32,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:32,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117532685] [2019-11-24 05:46:32,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:32,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:32,766 INFO L87 Difference]: Start difference. First operand 493 states and 657 transitions. Second operand 5 states. [2019-11-24 05:46:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:32,971 INFO L93 Difference]: Finished difference Result 906 states and 1224 transitions. [2019-11-24 05:46:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:32,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-24 05:46:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:32,975 INFO L225 Difference]: With dead ends: 906 [2019-11-24 05:46:32,975 INFO L226 Difference]: Without dead ends: 493 [2019-11-24 05:46:32,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-24 05:46:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-11-24 05:46:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-24 05:46:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 656 transitions. [2019-11-24 05:46:33,015 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 656 transitions. Word has length 44 [2019-11-24 05:46:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:33,016 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 656 transitions. [2019-11-24 05:46:33,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 656 transitions. [2019-11-24 05:46:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 05:46:33,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:33,017 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] [2019-11-24 05:46:33,017 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1019049524, now seen corresponding path program 1 times [2019-11-24 05:46:33,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:33,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876387905] [2019-11-24 05:46:33,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:33,264 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-24 05:46:33,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876387905] [2019-11-24 05:46:33,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:33,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559417691] [2019-11-24 05:46:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:46:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:46:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:46:33,267 INFO L87 Difference]: Start difference. First operand 493 states and 656 transitions. Second operand 10 states. [2019-11-24 05:46:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:33,832 INFO L93 Difference]: Finished difference Result 1030 states and 1373 transitions. [2019-11-24 05:46:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:46:33,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-24 05:46:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:33,838 INFO L225 Difference]: With dead ends: 1030 [2019-11-24 05:46:33,838 INFO L226 Difference]: Without dead ends: 862 [2019-11-24 05:46:33,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:46:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-11-24 05:46:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 617. [2019-11-24 05:46:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-24 05:46:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 815 transitions. [2019-11-24 05:46:33,894 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 815 transitions. Word has length 44 [2019-11-24 05:46:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:33,895 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 815 transitions. [2019-11-24 05:46:33,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:46:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 815 transitions. [2019-11-24 05:46:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 05:46:33,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:33,896 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] [2019-11-24 05:46:33,896 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1280765420, now seen corresponding path program 1 times [2019-11-24 05:46:33,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:33,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792417240] [2019-11-24 05:46:33,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:34,079 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-24 05:46:34,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792417240] [2019-11-24 05:46:34,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:34,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:34,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015559311] [2019-11-24 05:46:34,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:46:34,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:46:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:46:34,081 INFO L87 Difference]: Start difference. First operand 617 states and 815 transitions. Second operand 10 states. [2019-11-24 05:46:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:34,818 INFO L93 Difference]: Finished difference Result 1158 states and 1523 transitions. [2019-11-24 05:46:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:46:34,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-24 05:46:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:34,826 INFO L225 Difference]: With dead ends: 1158 [2019-11-24 05:46:34,827 INFO L226 Difference]: Without dead ends: 1106 [2019-11-24 05:46:34,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-24 05:46:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-24 05:46:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 767. [2019-11-24 05:46:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-24 05:46:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1007 transitions. [2019-11-24 05:46:34,912 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1007 transitions. Word has length 44 [2019-11-24 05:46:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:34,913 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1007 transitions. [2019-11-24 05:46:34,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:46:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1007 transitions. [2019-11-24 05:46:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:46:34,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:34,914 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] [2019-11-24 05:46:34,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 55788868, now seen corresponding path program 1 times [2019-11-24 05:46:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:34,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604110265] [2019-11-24 05:46:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:35,076 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-24 05:46:35,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604110265] [2019-11-24 05:46:35,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:35,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:35,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201268517] [2019-11-24 05:46:35,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:46:35,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:46:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:46:35,078 INFO L87 Difference]: Start difference. First operand 767 states and 1007 transitions. Second operand 10 states. [2019-11-24 05:46:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:35,961 INFO L93 Difference]: Finished difference Result 2866 states and 3935 transitions. [2019-11-24 05:46:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 05:46:35,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-24 05:46:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:35,980 INFO L225 Difference]: With dead ends: 2866 [2019-11-24 05:46:35,981 INFO L226 Difference]: Without dead ends: 2496 [2019-11-24 05:46:35,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:46:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2019-11-24 05:46:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1671. [2019-11-24 05:46:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-11-24 05:46:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2234 transitions. [2019-11-24 05:46:36,227 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2234 transitions. Word has length 45 [2019-11-24 05:46:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:36,228 INFO L462 AbstractCegarLoop]: Abstraction has 1671 states and 2234 transitions. [2019-11-24 05:46:36,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:46:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2234 transitions. [2019-11-24 05:46:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 05:46:36,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:36,229 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] [2019-11-24 05:46:36,229 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 456606856, now seen corresponding path program 1 times [2019-11-24 05:46:36,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:36,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290382239] [2019-11-24 05:46:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:36,515 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-24 05:46:36,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290382239] [2019-11-24 05:46:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:36,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:46:36,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023028054] [2019-11-24 05:46:36,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:46:36,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:46:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:36,518 INFO L87 Difference]: Start difference. First operand 1671 states and 2234 transitions. Second operand 12 states. [2019-11-24 05:46:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:37,819 INFO L93 Difference]: Finished difference Result 3758 states and 5044 transitions. [2019-11-24 05:46:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:46:37,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-11-24 05:46:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:37,840 INFO L225 Difference]: With dead ends: 3758 [2019-11-24 05:46:37,840 INFO L226 Difference]: Without dead ends: 3598 [2019-11-24 05:46:37,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:46:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2019-11-24 05:46:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1680. [2019-11-24 05:46:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2019-11-24 05:46:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2242 transitions. [2019-11-24 05:46:38,032 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2242 transitions. Word has length 46 [2019-11-24 05:46:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:38,034 INFO L462 AbstractCegarLoop]: Abstraction has 1680 states and 2242 transitions. [2019-11-24 05:46:38,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:46:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2242 transitions. [2019-11-24 05:46:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:46:38,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:38,035 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] [2019-11-24 05:46:38,035 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 480900024, now seen corresponding path program 1 times [2019-11-24 05:46:38,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:38,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816195252] [2019-11-24 05:46:38,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:38,286 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-24 05:46:38,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816195252] [2019-11-24 05:46:38,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:38,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:46:38,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272210923] [2019-11-24 05:46:38,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:46:38,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:46:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:38,296 INFO L87 Difference]: Start difference. First operand 1680 states and 2242 transitions. Second operand 12 states. [2019-11-24 05:46:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:39,154 INFO L93 Difference]: Finished difference Result 5217 states and 7089 transitions. [2019-11-24 05:46:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:46:39,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-24 05:46:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:39,175 INFO L225 Difference]: With dead ends: 5217 [2019-11-24 05:46:39,175 INFO L226 Difference]: Without dead ends: 3951 [2019-11-24 05:46:39,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-11-24 05:46:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2019-11-24 05:46:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2717. [2019-11-24 05:46:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-11-24 05:46:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3663 transitions. [2019-11-24 05:46:39,491 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3663 transitions. Word has length 47 [2019-11-24 05:46:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:39,491 INFO L462 AbstractCegarLoop]: Abstraction has 2717 states and 3663 transitions. [2019-11-24 05:46:39,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:46:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3663 transitions. [2019-11-24 05:46:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:46:39,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:39,493 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] [2019-11-24 05:46:39,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1818914920, now seen corresponding path program 1 times [2019-11-24 05:46:39,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:39,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588889454] [2019-11-24 05:46:39,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:39,757 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-24 05:46:39,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588889454] [2019-11-24 05:46:39,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:39,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:46:39,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058381117] [2019-11-24 05:46:39,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:46:39,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:39,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:46:39,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:39,760 INFO L87 Difference]: Start difference. First operand 2717 states and 3663 transitions. Second operand 12 states. [2019-11-24 05:46:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:40,805 INFO L93 Difference]: Finished difference Result 3941 states and 5315 transitions. [2019-11-24 05:46:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:46:40,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-24 05:46:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:40,823 INFO L225 Difference]: With dead ends: 3941 [2019-11-24 05:46:40,823 INFO L226 Difference]: Without dead ends: 3571 [2019-11-24 05:46:40,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:46:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2019-11-24 05:46:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2732. [2019-11-24 05:46:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-11-24 05:46:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3678 transitions. [2019-11-24 05:46:41,127 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3678 transitions. Word has length 47 [2019-11-24 05:46:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:41,128 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 3678 transitions. [2019-11-24 05:46:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:46:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3678 transitions. [2019-11-24 05:46:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:46:41,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:41,130 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] [2019-11-24 05:46:41,130 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1540896709, now seen corresponding path program 1 times [2019-11-24 05:46:41,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:41,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577576428] [2019-11-24 05:46:41,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:41,178 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-24 05:46:41,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577576428] [2019-11-24 05:46:41,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:41,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:41,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433079834] [2019-11-24 05:46:41,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:41,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:41,180 INFO L87 Difference]: Start difference. First operand 2732 states and 3678 transitions. Second operand 3 states. [2019-11-24 05:46:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:41,532 INFO L93 Difference]: Finished difference Result 4797 states and 6504 transitions. [2019-11-24 05:46:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:41,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 05:46:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:41,545 INFO L225 Difference]: With dead ends: 4797 [2019-11-24 05:46:41,546 INFO L226 Difference]: Without dead ends: 2655 [2019-11-24 05:46:41,549 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-24 05:46:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-11-24 05:46:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2602. [2019-11-24 05:46:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2019-11-24 05:46:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3493 transitions. [2019-11-24 05:46:41,761 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 3493 transitions. Word has length 47 [2019-11-24 05:46:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:41,762 INFO L462 AbstractCegarLoop]: Abstraction has 2602 states and 3493 transitions. [2019-11-24 05:46:41,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3493 transitions. [2019-11-24 05:46:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:46:41,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:41,763 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] [2019-11-24 05:46:41,763 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 50770638, now seen corresponding path program 1 times [2019-11-24 05:46:41,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:41,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153818461] [2019-11-24 05:46:41,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:41,787 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-24 05:46:41,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153818461] [2019-11-24 05:46:41,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:41,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:41,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158664308] [2019-11-24 05:46:41,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:41,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:41,790 INFO L87 Difference]: Start difference. First operand 2602 states and 3493 transitions. Second operand 3 states. [2019-11-24 05:46:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:41,994 INFO L93 Difference]: Finished difference Result 4473 states and 6054 transitions. [2019-11-24 05:46:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:41,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 05:46:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:42,005 INFO L225 Difference]: With dead ends: 4473 [2019-11-24 05:46:42,005 INFO L226 Difference]: Without dead ends: 2363 [2019-11-24 05:46:42,012 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-24 05:46:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2019-11-24 05:46:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2359. [2019-11-24 05:46:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-11-24 05:46:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3165 transitions. [2019-11-24 05:46:42,284 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3165 transitions. Word has length 48 [2019-11-24 05:46:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:42,284 INFO L462 AbstractCegarLoop]: Abstraction has 2359 states and 3165 transitions. [2019-11-24 05:46:42,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3165 transitions. [2019-11-24 05:46:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:46:42,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:42,285 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] [2019-11-24 05:46:42,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1308987124, now seen corresponding path program 1 times [2019-11-24 05:46:42,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:42,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804957925] [2019-11-24 05:46:42,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:43,186 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-11-24 05:46:43,489 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-11-24 05:46:43,861 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-24 05:46:43,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804957925] [2019-11-24 05:46:43,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:43,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-24 05:46:43,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330853465] [2019-11-24 05:46:43,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-24 05:46:43,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-24 05:46:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:46:43,863 INFO L87 Difference]: Start difference. First operand 2359 states and 3165 transitions. Second operand 24 states. [2019-11-24 05:46:44,683 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-24 05:46:44,915 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-24 05:46:45,172 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-24 05:46:45,424 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-24 05:46:45,783 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-24 05:46:46,149 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-11-24 05:46:46,474 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-24 05:46:46,731 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-24 05:46:47,117 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-24 05:46:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:48,459 INFO L93 Difference]: Finished difference Result 4345 states and 5874 transitions. [2019-11-24 05:46:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-24 05:46:48,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2019-11-24 05:46:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:48,477 INFO L225 Difference]: With dead ends: 4345 [2019-11-24 05:46:48,477 INFO L226 Difference]: Without dead ends: 4007 [2019-11-24 05:46:48,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2019-11-24 05:46:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2019-11-24 05:46:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 2347. [2019-11-24 05:46:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-11-24 05:46:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3152 transitions. [2019-11-24 05:46:48,701 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3152 transitions. Word has length 49 [2019-11-24 05:46:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:48,701 INFO L462 AbstractCegarLoop]: Abstraction has 2347 states and 3152 transitions. [2019-11-24 05:46:48,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-24 05:46:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3152 transitions. [2019-11-24 05:46:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:48,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:48,703 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] [2019-11-24 05:46:48,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash 384620135, now seen corresponding path program 1 times [2019-11-24 05:46:48,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:48,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252124032] [2019-11-24 05:46:48,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:48,752 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-24 05:46:48,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252124032] [2019-11-24 05:46:48,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:48,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:48,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57139101] [2019-11-24 05:46:48,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:48,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:48,755 INFO L87 Difference]: Start difference. First operand 2347 states and 3152 transitions. Second operand 3 states. [2019-11-24 05:46:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:49,032 INFO L93 Difference]: Finished difference Result 4144 states and 5584 transitions. [2019-11-24 05:46:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:49,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:49,043 INFO L225 Difference]: With dead ends: 4144 [2019-11-24 05:46:49,043 INFO L226 Difference]: Without dead ends: 2858 [2019-11-24 05:46:49,048 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-24 05:46:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-11-24 05:46:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2641. [2019-11-24 05:46:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-11-24 05:46:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3519 transitions. [2019-11-24 05:46:49,227 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3519 transitions. Word has length 54 [2019-11-24 05:46:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:49,227 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 3519 transitions. [2019-11-24 05:46:49,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3519 transitions. [2019-11-24 05:46:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 05:46:49,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:49,229 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] [2019-11-24 05:46:49,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash 5139822, now seen corresponding path program 1 times [2019-11-24 05:46:49,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:49,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145383174] [2019-11-24 05:46:49,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:49,278 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-24 05:46:49,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145383174] [2019-11-24 05:46:49,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:49,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:49,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841565796] [2019-11-24 05:46:49,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:49,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:49,280 INFO L87 Difference]: Start difference. First operand 2641 states and 3519 transitions. Second operand 3 states. [2019-11-24 05:46:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:49,523 INFO L93 Difference]: Finished difference Result 5429 states and 7324 transitions. [2019-11-24 05:46:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:49,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-24 05:46:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:49,530 INFO L225 Difference]: With dead ends: 5429 [2019-11-24 05:46:49,530 INFO L226 Difference]: Without dead ends: 3258 [2019-11-24 05:46:49,534 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-24 05:46:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2019-11-24 05:46:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 3256. [2019-11-24 05:46:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2019-11-24 05:46:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4347 transitions. [2019-11-24 05:46:49,914 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4347 transitions. Word has length 57 [2019-11-24 05:46:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:49,914 INFO L462 AbstractCegarLoop]: Abstraction has 3256 states and 4347 transitions. [2019-11-24 05:46:49,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4347 transitions. [2019-11-24 05:46:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 05:46:49,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:49,915 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] [2019-11-24 05:46:49,916 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1248271758, now seen corresponding path program 1 times [2019-11-24 05:46:49,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:49,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867463995] [2019-11-24 05:46:49,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:49,968 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-24 05:46:49,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867463995] [2019-11-24 05:46:49,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:49,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:49,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786666291] [2019-11-24 05:46:49,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:49,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:49,970 INFO L87 Difference]: Start difference. First operand 3256 states and 4347 transitions. Second operand 3 states. [2019-11-24 05:46:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:50,274 INFO L93 Difference]: Finished difference Result 6543 states and 8786 transitions. [2019-11-24 05:46:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:50,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-24 05:46:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:50,283 INFO L225 Difference]: With dead ends: 6543 [2019-11-24 05:46:50,283 INFO L226 Difference]: Without dead ends: 4092 [2019-11-24 05:46:50,287 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-24 05:46:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-24 05:46:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3767. [2019-11-24 05:46:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2019-11-24 05:46:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4993 transitions. [2019-11-24 05:46:50,718 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4993 transitions. Word has length 57 [2019-11-24 05:46:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:50,718 INFO L462 AbstractCegarLoop]: Abstraction has 3767 states and 4993 transitions. [2019-11-24 05:46:50,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4993 transitions. [2019-11-24 05:46:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 05:46:50,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:50,719 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] [2019-11-24 05:46:50,719 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash -540023858, now seen corresponding path program 1 times [2019-11-24 05:46:50,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:50,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366110434] [2019-11-24 05:46:50,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:50,771 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-24 05:46:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366110434] [2019-11-24 05:46:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434207737] [2019-11-24 05:46:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:50,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:50,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:50,773 INFO L87 Difference]: Start difference. First operand 3767 states and 4993 transitions. Second operand 3 states. [2019-11-24 05:46:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:51,475 INFO L93 Difference]: Finished difference Result 7421 states and 9844 transitions. [2019-11-24 05:46:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:51,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-24 05:46:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:51,489 INFO L225 Difference]: With dead ends: 7421 [2019-11-24 05:46:51,489 INFO L226 Difference]: Without dead ends: 5200 [2019-11-24 05:46:51,494 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-24 05:46:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-11-24 05:46:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 4911. [2019-11-24 05:46:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4911 states. [2019-11-24 05:46:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 6442 transitions. [2019-11-24 05:46:52,092 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 6442 transitions. Word has length 61 [2019-11-24 05:46:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:52,092 INFO L462 AbstractCegarLoop]: Abstraction has 4911 states and 6442 transitions. [2019-11-24 05:46:52,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 6442 transitions. [2019-11-24 05:46:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 05:46:52,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:52,093 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] [2019-11-24 05:46:52,094 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 640876091, now seen corresponding path program 1 times [2019-11-24 05:46:52,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:52,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482318586] [2019-11-24 05:46:52,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:52,207 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-24 05:46:52,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482318586] [2019-11-24 05:46:52,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:52,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:46:52,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309095321] [2019-11-24 05:46:52,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:46:52,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:46:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:52,211 INFO L87 Difference]: Start difference. First operand 4911 states and 6442 transitions. Second operand 7 states. [2019-11-24 05:46:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:52,780 INFO L93 Difference]: Finished difference Result 6650 states and 8706 transitions. [2019-11-24 05:46:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:46:52,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-24 05:46:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:52,789 INFO L225 Difference]: With dead ends: 6650 [2019-11-24 05:46:52,789 INFO L226 Difference]: Without dead ends: 6648 [2019-11-24 05:46:52,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6648 states. [2019-11-24 05:46:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6648 to 5708. [2019-11-24 05:46:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2019-11-24 05:46:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 7447 transitions. [2019-11-24 05:46:53,368 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 7447 transitions. Word has length 64 [2019-11-24 05:46:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:53,369 INFO L462 AbstractCegarLoop]: Abstraction has 5708 states and 7447 transitions. [2019-11-24 05:46:53,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:46:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 7447 transitions. [2019-11-24 05:46:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 05:46:53,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:53,372 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:46:53,372 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:53,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1561215234, now seen corresponding path program 1 times [2019-11-24 05:46:53,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:53,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714865483] [2019-11-24 05:46:53,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:53,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714865483] [2019-11-24 05:46:53,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579404399] [2019-11-24 05:46:53,820 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-24 05:46:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:53,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-24 05:46:53,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:46:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:46:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:46:54,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:46:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:46:54,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:46:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:46:55,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:46:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:46:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:46:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 12] imperfect sequences [14] total 40 [2019-11-24 05:46:55,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931609391] [2019-11-24 05:46:55,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-24 05:46:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-24 05:46:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1344, Unknown=0, NotChecked=0, Total=1560 [2019-11-24 05:46:55,820 INFO L87 Difference]: Start difference. First operand 5708 states and 7447 transitions. Second operand 28 states. [2019-11-24 05:46:56,644 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-11-24 05:46:56,810 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-24 05:46:57,414 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-24 05:46:57,602 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-11-24 05:46:58,012 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-11-24 05:46:58,238 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-11-24 05:46:58,605 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-24 05:46:59,209 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-11-24 05:46:59,433 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-11-24 05:46:59,978 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-11-24 05:47:00,179 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-11-24 05:47:00,351 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-11-24 05:47:00,620 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-11-24 05:47:01,035 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-11-24 05:47:01,277 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-11-24 05:47:02,248 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-24 05:47:02,564 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-24 05:47:02,989 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-11-24 05:47:03,444 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-24 05:47:03,942 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-11-24 05:47:04,125 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 37 [2019-11-24 05:47:04,373 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-24 05:47:04,771 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-24 05:47:04,918 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-11-24 05:47:05,184 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-24 05:47:05,707 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-24 05:47:06,347 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-11-24 05:47:06,741 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-11-24 05:47:07,069 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-11-24 05:47:07,504 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-24 05:47:08,326 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-24 05:47:08,613 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-11-24 05:47:08,881 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-11-24 05:47:09,288 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-11-24 05:47:09,725 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-11-24 05:47:10,028 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-24 05:47:10,376 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-11-24 05:47:10,718 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-11-24 05:47:11,162 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-24 05:47:11,669 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-11-24 05:47:12,000 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-24 05:47:12,498 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-11-24 05:47:12,751 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-11-24 05:47:13,637 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-11-24 05:47:14,169 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-11-24 05:47:14,359 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-24 05:47:14,659 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-24 05:47:15,004 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-11-24 05:47:15,206 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-11-24 05:47:15,560 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-24 05:47:16,000 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-24 05:47:16,299 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-11-24 05:47:16,704 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-24 05:47:16,885 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-24 05:47:17,183 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-24 05:47:17,471 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-11-24 05:47:17,717 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-24 05:47:18,083 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-11-24 05:47:18,283 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-11-24 05:47:19,024 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-24 05:47:19,324 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-24 05:47:19,493 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-11-24 05:47:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:19,514 INFO L93 Difference]: Finished difference Result 19827 states and 26268 transitions. [2019-11-24 05:47:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-24 05:47:19,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2019-11-24 05:47:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:19,543 INFO L225 Difference]: With dead ends: 19827 [2019-11-24 05:47:19,544 INFO L226 Difference]: Without dead ends: 15667 [2019-11-24 05:47:19,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6336 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=2767, Invalid=15055, Unknown=0, NotChecked=0, Total=17822 [2019-11-24 05:47:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15667 states. [2019-11-24 05:47:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15667 to 7745. [2019-11-24 05:47:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7745 states. [2019-11-24 05:47:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 10118 transitions. [2019-11-24 05:47:20,589 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 10118 transitions. Word has length 74 [2019-11-24 05:47:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:20,590 INFO L462 AbstractCegarLoop]: Abstraction has 7745 states and 10118 transitions. [2019-11-24 05:47:20,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-24 05:47:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 10118 transitions. [2019-11-24 05:47:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 05:47:20,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:20,592 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:47:20,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:47:20,793 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1652566603, now seen corresponding path program 1 times [2019-11-24 05:47:20,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:20,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760730493] [2019-11-24 05:47:20,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:47:20,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760730493] [2019-11-24 05:47:20,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:20,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:47:20,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183308111] [2019-11-24 05:47:20,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:47:20,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:47:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:47:20,921 INFO L87 Difference]: Start difference. First operand 7745 states and 10118 transitions. Second operand 6 states. [2019-11-24 05:47:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:23,074 INFO L93 Difference]: Finished difference Result 22620 states and 29657 transitions. [2019-11-24 05:47:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:47:23,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-11-24 05:47:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:23,097 INFO L225 Difference]: With dead ends: 22620 [2019-11-24 05:47:23,097 INFO L226 Difference]: Without dead ends: 15331 [2019-11-24 05:47:23,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15331 states. [2019-11-24 05:47:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15331 to 11651. [2019-11-24 05:47:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11651 states. [2019-11-24 05:47:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11651 states to 11651 states and 15058 transitions. [2019-11-24 05:47:24,698 INFO L78 Accepts]: Start accepts. Automaton has 11651 states and 15058 transitions. Word has length 74 [2019-11-24 05:47:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:24,698 INFO L462 AbstractCegarLoop]: Abstraction has 11651 states and 15058 transitions. [2019-11-24 05:47:24,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:47:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 11651 states and 15058 transitions. [2019-11-24 05:47:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 05:47:24,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:24,701 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:47:24,701 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 482896410, now seen corresponding path program 1 times [2019-11-24 05:47:24,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:24,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719911471] [2019-11-24 05:47:24,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719911471] [2019-11-24 05:47:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206884238] [2019-11-24 05:47:25,129 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-24 05:47:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:25,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-24 05:47:25,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:47:25,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:25,865 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:47:25,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:25,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,132 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-24 05:47:26,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,565 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-24 05:47:26,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:26,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:26,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:27,569 WARN L192 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2019-11-24 05:47:28,160 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 109 [2019-11-24 05:47:28,581 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-24 05:47:28,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:28,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:47:28,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:28,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:28,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:47:28,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:47:28,764 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-24 05:47:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:28,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:29,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:29,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1376947614] [2019-11-24 05:47:29,180 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2019-11-24 05:47:29,180 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:47:29,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:47:29,193 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:47:29,193 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:47:30,239 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2019-11-24 05:47:42,768 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2019-11-24 05:47:43,743 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:43,912 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:44,088 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:44,265 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:44,444 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:44,601 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 05:47:44,853 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 05:47:46,443 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 267 DAG size of output: 119 [2019-11-24 05:47:46,673 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-24 05:47:47,050 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-11-24 05:47:47,455 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 114 [2019-11-24 05:47:47,865 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-11-24 05:47:48,268 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-24 05:47:48,671 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-24 05:47:49,101 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-11-24 05:47:49,599 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111