/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/product-lines/elevator_spec2_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:40:48,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:40:48,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:40:48,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:40:48,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:40:48,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:40:48,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:40:48,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:40:48,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:40:48,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:40:48,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:40:48,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:40:48,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:40:48,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:40:48,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:40:48,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:40:48,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:40:48,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:40:48,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:40:48,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:40:48,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:40:48,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:40:48,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:40:48,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:40:48,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:40:48,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:40:48,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:40:48,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:40:48,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:40:48,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:40:48,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:40:48,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:40:48,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:40:48,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:40:48,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:40:48,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:40:48,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:40:48,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:40:48,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:40:48,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:40:48,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:40:48,443 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 04:40:48,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:40:48,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:40:48,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:40:48,458 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:40:48,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:40:48,459 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:40:48,459 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:40:48,459 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:40:48,459 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:40:48,459 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:40:48,460 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:40:48,460 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:40:48,460 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:40:48,460 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:40:48,460 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:40:48,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:40:48,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:40:48,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:40:48,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:40:48,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:40:48,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:40:48,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:40:48,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:40:48,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:40:48,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:40:48,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:40:48,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:40:48,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:40:48,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:40:48,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:48,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:40:48,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:40:48,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:40:48,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:40:48,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:40:48,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:40:48,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:40:48,466 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:40:48,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:40:48,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:40:48,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:40:48,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:40:48,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:40:48,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-11-24 04:40:48,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad57f6c5d/17b4673ded864fbda89323715a2d412e/FLAGa6b922c3e [2019-11-24 04:40:49,476 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:40:49,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-11-24 04:40:49,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad57f6c5d/17b4673ded864fbda89323715a2d412e/FLAGa6b922c3e [2019-11-24 04:40:49,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad57f6c5d/17b4673ded864fbda89323715a2d412e [2019-11-24 04:40:49,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:40:49,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:40:49,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:49,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:40:49,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:40:49,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:49" (1/1) ... [2019-11-24 04:40:49,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6886fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:49, skipping insertion in model container [2019-11-24 04:40:49,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:49" (1/1) ... [2019-11-24 04:40:49,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:40:49,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:40:50,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:50,501 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:40:50,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:50,712 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:40:50,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50 WrapperNode [2019-11-24 04:40:50,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:50,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:50,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:40:50,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:40:50,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:50,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:50,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:50,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:40:50,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:40:50,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:40:50,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:50,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:50,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:50,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:51,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:51,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:51,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (1/1) ... [2019-11-24 04:40:51,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:40:51,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:40:51,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:40:51,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:40:51,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (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 04:40:51,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:40:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:40:51,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:40:51,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:20,082 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:20,083 INFO L284 CfgBuilder]: Removed 565 assume(true) statements. [2019-11-24 04:41:20,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:20 BoogieIcfgContainer [2019-11-24 04:41:20,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:20,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:20,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:20,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:20,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:40:49" (1/3) ... [2019-11-24 04:41:20,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242f4b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:20, skipping insertion in model container [2019-11-24 04:41:20,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:50" (2/3) ... [2019-11-24 04:41:20,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242f4b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:20, skipping insertion in model container [2019-11-24 04:41:20,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:20" (3/3) ... [2019-11-24 04:41:20,100 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2019-11-24 04:41:20,111 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:20,119 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:20,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:20,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:20,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:20,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:20,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:20,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:20,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:20,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:20,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:41:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:41:20,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:20,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:20,224 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1745912929, now seen corresponding path program 1 times [2019-11-24 04:41:20,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:20,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211809036] [2019-11-24 04:41:20,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:20,715 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 04:41:20,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211809036] [2019-11-24 04:41:20,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:20,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:41:20,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763082092] [2019-11-24 04:41:20,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:41:20,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:41:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:20,740 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:41:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:20,819 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:41:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:41:20,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:41:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:20,843 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:41:20,843 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:41:20,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:41:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:41:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:41:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:41:20,966 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:41:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:20,967 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:41:20,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:41:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:41:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:41:20,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:20,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:20,970 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1703953115, now seen corresponding path program 1 times [2019-11-24 04:41:20,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:20,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125241145] [2019-11-24 04:41:20,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:21,153 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 04:41:21,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125241145] [2019-11-24 04:41:21,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:21,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998573395] [2019-11-24 04:41:21,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:21,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:21,158 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 3 states. [2019-11-24 04:41:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:21,440 INFO L93 Difference]: Finished difference Result 1337 states and 2550 transitions. [2019-11-24 04:41:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:21,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:41:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:21,448 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 04:41:21,448 INFO L226 Difference]: Without dead ends: 943 [2019-11-24 04:41:21,452 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 04:41:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-24 04:41:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906. [2019-11-24 04:41:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-24 04:41:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1729 transitions. [2019-11-24 04:41:21,486 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1729 transitions. Word has length 15 [2019-11-24 04:41:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:21,487 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1729 transitions. [2019-11-24 04:41:21,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1729 transitions. [2019-11-24 04:41:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:41:21,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:21,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:21,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2032223990, now seen corresponding path program 1 times [2019-11-24 04:41:21,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:21,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625844105] [2019-11-24 04:41:21,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:21,606 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 04:41:21,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625844105] [2019-11-24 04:41:21,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:21,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:21,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655226437] [2019-11-24 04:41:21,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:21,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:21,612 INFO L87 Difference]: Start difference. First operand 906 states and 1729 transitions. Second operand 3 states. [2019-11-24 04:41:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:21,905 INFO L93 Difference]: Finished difference Result 1863 states and 3548 transitions. [2019-11-24 04:41:21,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:21,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:41:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:21,916 INFO L225 Difference]: With dead ends: 1863 [2019-11-24 04:41:21,917 INFO L226 Difference]: Without dead ends: 1327 [2019-11-24 04:41:21,919 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 04:41:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-11-24 04:41:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1214. [2019-11-24 04:41:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-11-24 04:41:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2311 transitions. [2019-11-24 04:41:21,973 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2311 transitions. Word has length 17 [2019-11-24 04:41:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:21,974 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2311 transitions. [2019-11-24 04:41:21,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2311 transitions. [2019-11-24 04:41:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:41:21,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:21,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:21,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2070500274, now seen corresponding path program 1 times [2019-11-24 04:41:21,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:21,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850846676] [2019-11-24 04:41:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:22,075 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 04:41:22,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850846676] [2019-11-24 04:41:22,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:22,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:22,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894991292] [2019-11-24 04:41:22,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:22,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:22,078 INFO L87 Difference]: Start difference. First operand 1214 states and 2311 transitions. Second operand 3 states. [2019-11-24 04:41:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:22,322 INFO L93 Difference]: Finished difference Result 2045 states and 3885 transitions. [2019-11-24 04:41:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:22,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:41:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:22,331 INFO L225 Difference]: With dead ends: 2045 [2019-11-24 04:41:22,331 INFO L226 Difference]: Without dead ends: 1204 [2019-11-24 04:41:22,333 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 04:41:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-11-24 04:41:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2019-11-24 04:41:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-24 04:41:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2285 transitions. [2019-11-24 04:41:22,376 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2285 transitions. Word has length 19 [2019-11-24 04:41:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:22,376 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 2285 transitions. [2019-11-24 04:41:22,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2285 transitions. [2019-11-24 04:41:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:41:22,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:22,378 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] [2019-11-24 04:41:22,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -979770052, now seen corresponding path program 1 times [2019-11-24 04:41:22,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:22,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587319532] [2019-11-24 04:41:22,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:22,470 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 04:41:22,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587319532] [2019-11-24 04:41:22,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:22,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:22,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586709431] [2019-11-24 04:41:22,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:22,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:22,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:22,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:22,473 INFO L87 Difference]: Start difference. First operand 1204 states and 2285 transitions. Second operand 3 states. [2019-11-24 04:41:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:22,795 INFO L93 Difference]: Finished difference Result 2758 states and 5223 transitions. [2019-11-24 04:41:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:41:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:22,807 INFO L225 Difference]: With dead ends: 2758 [2019-11-24 04:41:22,807 INFO L226 Difference]: Without dead ends: 1944 [2019-11-24 04:41:22,809 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 04:41:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2019-11-24 04:41:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1792. [2019-11-24 04:41:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-11-24 04:41:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3386 transitions. [2019-11-24 04:41:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 3386 transitions. Word has length 20 [2019-11-24 04:41:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:22,882 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 3386 transitions. [2019-11-24 04:41:22,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 3386 transitions. [2019-11-24 04:41:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:22,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:22,884 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] [2019-11-24 04:41:22,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -308082963, now seen corresponding path program 1 times [2019-11-24 04:41:22,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:22,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140652746] [2019-11-24 04:41:22,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:23,040 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 04:41:23,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140652746] [2019-11-24 04:41:23,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:23,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:23,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826130399] [2019-11-24 04:41:23,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:23,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:23,042 INFO L87 Difference]: Start difference. First operand 1792 states and 3386 transitions. Second operand 3 states. [2019-11-24 04:41:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:23,274 INFO L93 Difference]: Finished difference Result 1792 states and 3386 transitions. [2019-11-24 04:41:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:23,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:23,290 INFO L225 Difference]: With dead ends: 1792 [2019-11-24 04:41:23,290 INFO L226 Difference]: Without dead ends: 1785 [2019-11-24 04:41:23,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:41:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-24 04:41:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-11-24 04:41:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-24 04:41:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3374 transitions. [2019-11-24 04:41:23,392 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3374 transitions. Word has length 21 [2019-11-24 04:41:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:23,393 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 3374 transitions. [2019-11-24 04:41:23,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3374 transitions. [2019-11-24 04:41:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:23,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:23,396 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] [2019-11-24 04:41:23,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash -694498699, now seen corresponding path program 1 times [2019-11-24 04:41:23,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:23,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712645529] [2019-11-24 04:41:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:23,648 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 04:41:23,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712645529] [2019-11-24 04:41:23,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:23,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:23,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753183722] [2019-11-24 04:41:23,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:23,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:23,652 INFO L87 Difference]: Start difference. First operand 1785 states and 3374 transitions. Second operand 4 states. [2019-11-24 04:41:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:25,102 INFO L93 Difference]: Finished difference Result 3507 states and 6615 transitions. [2019-11-24 04:41:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:25,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 04:41:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:25,113 INFO L225 Difference]: With dead ends: 3507 [2019-11-24 04:41:25,114 INFO L226 Difference]: Without dead ends: 1932 [2019-11-24 04:41:25,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-24 04:41:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1785. [2019-11-24 04:41:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-24 04:41:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3324 transitions. [2019-11-24 04:41:25,203 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3324 transitions. Word has length 31 [2019-11-24 04:41:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:25,203 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 3324 transitions. [2019-11-24 04:41:25,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3324 transitions. [2019-11-24 04:41:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:41:25,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:25,206 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] [2019-11-24 04:41:25,207 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1168425995, now seen corresponding path program 1 times [2019-11-24 04:41:25,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:25,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799602665] [2019-11-24 04:41:25,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:25,413 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 04:41:25,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799602665] [2019-11-24 04:41:25,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:25,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:25,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249038289] [2019-11-24 04:41:25,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:25,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:25,415 INFO L87 Difference]: Start difference. First operand 1785 states and 3324 transitions. Second operand 3 states. [2019-11-24 04:41:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:26,560 INFO L93 Difference]: Finished difference Result 4523 states and 8416 transitions. [2019-11-24 04:41:26,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:26,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:41:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:26,577 INFO L225 Difference]: With dead ends: 4523 [2019-11-24 04:41:26,577 INFO L226 Difference]: Without dead ends: 2969 [2019-11-24 04:41:26,581 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 04:41:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-11-24 04:41:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1755. [2019-11-24 04:41:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-11-24 04:41:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 3244 transitions. [2019-11-24 04:41:26,696 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 3244 transitions. Word has length 36 [2019-11-24 04:41:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:26,697 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 3244 transitions. [2019-11-24 04:41:26,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3244 transitions. [2019-11-24 04:41:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:41:26,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:26,700 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] [2019-11-24 04:41:26,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1843516778, now seen corresponding path program 1 times [2019-11-24 04:41:26,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:26,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730770049] [2019-11-24 04:41:26,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:26,928 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 04:41:26,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730770049] [2019-11-24 04:41:26,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:26,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:26,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470921254] [2019-11-24 04:41:26,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:26,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:26,932 INFO L87 Difference]: Start difference. First operand 1755 states and 3244 transitions. Second operand 3 states. [2019-11-24 04:41:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:27,821 INFO L93 Difference]: Finished difference Result 4444 states and 8237 transitions. [2019-11-24 04:41:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:27,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:41:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:27,840 INFO L225 Difference]: With dead ends: 4444 [2019-11-24 04:41:27,840 INFO L226 Difference]: Without dead ends: 2947 [2019-11-24 04:41:27,845 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 04:41:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2019-11-24 04:41:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1735. [2019-11-24 04:41:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-11-24 04:41:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 3174 transitions. [2019-11-24 04:41:27,954 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 3174 transitions. Word has length 37 [2019-11-24 04:41:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:27,956 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 3174 transitions. [2019-11-24 04:41:27,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 3174 transitions. [2019-11-24 04:41:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:41:27,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:27,959 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] [2019-11-24 04:41:27,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash -120975195, now seen corresponding path program 1 times [2019-11-24 04:41:27,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:27,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993031782] [2019-11-24 04:41:27,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:28,220 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 04:41:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993031782] [2019-11-24 04:41:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:28,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:28,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384941786] [2019-11-24 04:41:28,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:28,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:28,224 INFO L87 Difference]: Start difference. First operand 1735 states and 3174 transitions. Second operand 3 states. [2019-11-24 04:41:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:29,119 INFO L93 Difference]: Finished difference Result 4380 states and 8073 transitions. [2019-11-24 04:41:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:29,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:41:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:29,135 INFO L225 Difference]: With dead ends: 4380 [2019-11-24 04:41:29,135 INFO L226 Difference]: Without dead ends: 2935 [2019-11-24 04:41:29,138 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 04:41:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-11-24 04:41:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1725. [2019-11-24 04:41:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-24 04:41:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3114 transitions. [2019-11-24 04:41:29,241 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3114 transitions. Word has length 39 [2019-11-24 04:41:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:29,241 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3114 transitions. [2019-11-24 04:41:29,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3114 transitions. [2019-11-24 04:41:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:41:29,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:29,244 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 04:41:29,244 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1179451513, now seen corresponding path program 1 times [2019-11-24 04:41:29,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:29,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222962798] [2019-11-24 04:41:29,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:29,437 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 04:41:29,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222962798] [2019-11-24 04:41:29,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:29,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:29,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222088695] [2019-11-24 04:41:29,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:29,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:29,440 INFO L87 Difference]: Start difference. First operand 1725 states and 3114 transitions. Second operand 3 states. [2019-11-24 04:41:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:30,200 INFO L93 Difference]: Finished difference Result 3270 states and 5938 transitions. [2019-11-24 04:41:30,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:30,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:41:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:30,210 INFO L225 Difference]: With dead ends: 3270 [2019-11-24 04:41:30,211 INFO L226 Difference]: Without dead ends: 1872 [2019-11-24 04:41:30,215 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 04:41:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-24 04:41:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1725. [2019-11-24 04:41:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-24 04:41:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3064 transitions. [2019-11-24 04:41:30,305 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3064 transitions. Word has length 42 [2019-11-24 04:41:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:30,308 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3064 transitions. [2019-11-24 04:41:30,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3064 transitions. [2019-11-24 04:41:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:41:30,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:30,310 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 04:41:30,310 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash 102866694, now seen corresponding path program 1 times [2019-11-24 04:41:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:30,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986104117] [2019-11-24 04:41:30,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:30,576 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 04:41:30,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986104117] [2019-11-24 04:41:30,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:30,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:30,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470434753] [2019-11-24 04:41:30,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:30,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:30,579 INFO L87 Difference]: Start difference. First operand 1725 states and 3064 transitions. Second operand 5 states. [2019-11-24 04:41:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:31,610 INFO L93 Difference]: Finished difference Result 6713 states and 12252 transitions. [2019-11-24 04:41:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:31,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:41:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:31,642 INFO L225 Difference]: With dead ends: 6713 [2019-11-24 04:41:31,642 INFO L226 Difference]: Without dead ends: 5003 [2019-11-24 04:41:31,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2019-11-24 04:41:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 2093. [2019-11-24 04:41:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 04:41:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3605 transitions. [2019-11-24 04:41:31,853 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3605 transitions. Word has length 45 [2019-11-24 04:41:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:31,853 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 3605 transitions. [2019-11-24 04:41:31,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3605 transitions. [2019-11-24 04:41:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:41:31,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:31,858 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 04:41:31,858 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1227211409, now seen corresponding path program 1 times [2019-11-24 04:41:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:31,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941873901] [2019-11-24 04:41:31,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:32,115 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 04:41:32,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941873901] [2019-11-24 04:41:32,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:32,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:32,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813001246] [2019-11-24 04:41:32,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:32,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:32,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:32,119 INFO L87 Difference]: Start difference. First operand 2093 states and 3605 transitions. Second operand 5 states. [2019-11-24 04:41:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:32,358 INFO L93 Difference]: Finished difference Result 3164 states and 5280 transitions. [2019-11-24 04:41:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:32,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-24 04:41:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:32,367 INFO L225 Difference]: With dead ends: 3164 [2019-11-24 04:41:32,367 INFO L226 Difference]: Without dead ends: 3146 [2019-11-24 04:41:32,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2019-11-24 04:41:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2107. [2019-11-24 04:41:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-24 04:41:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3619 transitions. [2019-11-24 04:41:32,527 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3619 transitions. Word has length 46 [2019-11-24 04:41:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:32,528 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 3619 transitions. [2019-11-24 04:41:32,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3619 transitions. [2019-11-24 04:41:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:41:32,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:32,530 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 04:41:32,530 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1501376443, now seen corresponding path program 1 times [2019-11-24 04:41:32,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571627827] [2019-11-24 04:41:32,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:32,718 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 04:41:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571627827] [2019-11-24 04:41:32,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:32,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:32,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697900210] [2019-11-24 04:41:32,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:32,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:32,721 INFO L87 Difference]: Start difference. First operand 2107 states and 3619 transitions. Second operand 3 states. [2019-11-24 04:41:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:32,942 INFO L93 Difference]: Finished difference Result 2129 states and 3642 transitions. [2019-11-24 04:41:32,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:32,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 04:41:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:32,951 INFO L225 Difference]: With dead ends: 2129 [2019-11-24 04:41:32,952 INFO L226 Difference]: Without dead ends: 2111 [2019-11-24 04:41:32,953 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 04:41:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2019-11-24 04:41:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2107. [2019-11-24 04:41:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-24 04:41:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3605 transitions. [2019-11-24 04:41:33,176 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3605 transitions. Word has length 47 [2019-11-24 04:41:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:33,177 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 3605 transitions. [2019-11-24 04:41:33,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3605 transitions. [2019-11-24 04:41:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:41:33,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:33,180 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 04:41:33,180 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:33,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1559314742, now seen corresponding path program 1 times [2019-11-24 04:41:33,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:33,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852051420] [2019-11-24 04:41:33,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:33,959 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 04:41:33,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852051420] [2019-11-24 04:41:33,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:33,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:33,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145302334] [2019-11-24 04:41:33,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:33,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:33,961 INFO L87 Difference]: Start difference. First operand 2107 states and 3605 transitions. Second operand 21 states. [2019-11-24 04:41:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:37,134 INFO L93 Difference]: Finished difference Result 6324 states and 11039 transitions. [2019-11-24 04:41:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:37,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-24 04:41:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:37,145 INFO L225 Difference]: With dead ends: 6324 [2019-11-24 04:41:37,146 INFO L226 Difference]: Without dead ends: 4358 [2019-11-24 04:41:37,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2019-11-24 04:41:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 2077. [2019-11-24 04:41:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-11-24 04:41:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3546 transitions. [2019-11-24 04:41:37,366 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3546 transitions. Word has length 48 [2019-11-24 04:41:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:37,366 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 3546 transitions. [2019-11-24 04:41:37,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3546 transitions. [2019-11-24 04:41:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:41:37,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:37,369 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 04:41:37,369 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 646670148, now seen corresponding path program 1 times [2019-11-24 04:41:37,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:37,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077438464] [2019-11-24 04:41:37,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:37,570 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 04:41:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077438464] [2019-11-24 04:41:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:37,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583994950] [2019-11-24 04:41:37,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:37,572 INFO L87 Difference]: Start difference. First operand 2077 states and 3546 transitions. Second operand 4 states. [2019-11-24 04:41:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:38,359 INFO L93 Difference]: Finished difference Result 5711 states and 9855 transitions. [2019-11-24 04:41:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:38,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:41:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:38,369 INFO L225 Difference]: With dead ends: 5711 [2019-11-24 04:41:38,370 INFO L226 Difference]: Without dead ends: 3751 [2019-11-24 04:41:38,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-11-24 04:41:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2012. [2019-11-24 04:41:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-11-24 04:41:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3421 transitions. [2019-11-24 04:41:38,633 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3421 transitions. Word has length 49 [2019-11-24 04:41:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:38,634 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 3421 transitions. [2019-11-24 04:41:38,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3421 transitions. [2019-11-24 04:41:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:41:38,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:38,636 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] [2019-11-24 04:41:38,636 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 442681139, now seen corresponding path program 1 times [2019-11-24 04:41:38,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:38,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132468568] [2019-11-24 04:41:38,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:39,448 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 04:41:39,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132468568] [2019-11-24 04:41:39,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:39,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:39,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428382637] [2019-11-24 04:41:39,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:39,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:39,453 INFO L87 Difference]: Start difference. First operand 2012 states and 3421 transitions. Second operand 21 states. [2019-11-24 04:41:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:43,203 INFO L93 Difference]: Finished difference Result 6276 states and 10885 transitions. [2019-11-24 04:41:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:43,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-11-24 04:41:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:43,215 INFO L225 Difference]: With dead ends: 6276 [2019-11-24 04:41:43,215 INFO L226 Difference]: Without dead ends: 4391 [2019-11-24 04:41:43,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2019-11-24 04:41:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 2217. [2019-11-24 04:41:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-11-24 04:41:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3680 transitions. [2019-11-24 04:41:43,479 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3680 transitions. Word has length 50 [2019-11-24 04:41:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:43,480 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 3680 transitions. [2019-11-24 04:41:43,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3680 transitions. [2019-11-24 04:41:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 04:41:43,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:43,482 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] [2019-11-24 04:41:43,483 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash 966285147, now seen corresponding path program 1 times [2019-11-24 04:41:43,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:43,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304416960] [2019-11-24 04:41:43,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:44,342 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 04:41:44,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304416960] [2019-11-24 04:41:44,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:44,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:44,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631789813] [2019-11-24 04:41:44,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:44,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:44,354 INFO L87 Difference]: Start difference. First operand 2217 states and 3680 transitions. Second operand 21 states. [2019-11-24 04:41:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:47,342 INFO L93 Difference]: Finished difference Result 6249 states and 10459 transitions. [2019-11-24 04:41:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:47,343 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-24 04:41:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:47,347 INFO L225 Difference]: With dead ends: 6249 [2019-11-24 04:41:47,347 INFO L226 Difference]: Without dead ends: 4245 [2019-11-24 04:41:47,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2019-11-24 04:41:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 2639. [2019-11-24 04:41:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-24 04:41:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4328 transitions. [2019-11-24 04:41:47,605 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4328 transitions. Word has length 53 [2019-11-24 04:41:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:47,605 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 4328 transitions. [2019-11-24 04:41:47,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4328 transitions. [2019-11-24 04:41:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 04:41:47,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:47,608 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:47,608 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1831320716, now seen corresponding path program 1 times [2019-11-24 04:41:47,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:47,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494034536] [2019-11-24 04:41:47,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:47,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494034536] [2019-11-24 04:41:47,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:47,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:47,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497488288] [2019-11-24 04:41:47,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:47,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:47,755 INFO L87 Difference]: Start difference. First operand 2639 states and 4328 transitions. Second operand 5 states. [2019-11-24 04:41:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:48,691 INFO L93 Difference]: Finished difference Result 6731 states and 11350 transitions. [2019-11-24 04:41:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:48,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 04:41:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:48,696 INFO L225 Difference]: With dead ends: 6731 [2019-11-24 04:41:48,696 INFO L226 Difference]: Without dead ends: 4307 [2019-11-24 04:41:48,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2019-11-24 04:41:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 2721. [2019-11-24 04:41:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2019-11-24 04:41:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 4410 transitions. [2019-11-24 04:41:48,932 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 4410 transitions. Word has length 62 [2019-11-24 04:41:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:48,933 INFO L462 AbstractCegarLoop]: Abstraction has 2721 states and 4410 transitions. [2019-11-24 04:41:48,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 4410 transitions. [2019-11-24 04:41:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:41:48,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:48,936 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:48,936 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 200214133, now seen corresponding path program 1 times [2019-11-24 04:41:48,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:48,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648752219] [2019-11-24 04:41:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:49,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648752219] [2019-11-24 04:41:49,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:49,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:49,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487177508] [2019-11-24 04:41:49,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:49,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:49,095 INFO L87 Difference]: Start difference. First operand 2721 states and 4410 transitions. Second operand 6 states. [2019-11-24 04:41:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:50,045 INFO L93 Difference]: Finished difference Result 6813 states and 11392 transitions. [2019-11-24 04:41:50,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:50,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-24 04:41:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:50,051 INFO L225 Difference]: With dead ends: 6813 [2019-11-24 04:41:50,052 INFO L226 Difference]: Without dead ends: 4307 [2019-11-24 04:41:50,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2019-11-24 04:41:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 2721. [2019-11-24 04:41:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2019-11-24 04:41:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 4370 transitions. [2019-11-24 04:41:50,354 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 4370 transitions. Word has length 63 [2019-11-24 04:41:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:50,354 INFO L462 AbstractCegarLoop]: Abstraction has 2721 states and 4370 transitions. [2019-11-24 04:41:50,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 4370 transitions. [2019-11-24 04:41:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:41:50,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:50,356 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:50,356 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash -894153856, now seen corresponding path program 1 times [2019-11-24 04:41:50,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:50,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677062980] [2019-11-24 04:41:50,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677062980] [2019-11-24 04:41:50,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:50,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:50,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124998321] [2019-11-24 04:41:50,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:50,556 INFO L87 Difference]: Start difference. First operand 2721 states and 4370 transitions. Second operand 5 states. [2019-11-24 04:41:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:51,548 INFO L93 Difference]: Finished difference Result 6877 states and 11398 transitions. [2019-11-24 04:41:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:51,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:41:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:51,555 INFO L225 Difference]: With dead ends: 6877 [2019-11-24 04:41:51,555 INFO L226 Difference]: Without dead ends: 4371 [2019-11-24 04:41:51,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-11-24 04:41:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2696. [2019-11-24 04:41:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-11-24 04:41:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4318 transitions. [2019-11-24 04:41:51,861 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4318 transitions. Word has length 64 [2019-11-24 04:41:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:51,861 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4318 transitions. [2019-11-24 04:41:51,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4318 transitions. [2019-11-24 04:41:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:51,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:51,863 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:51,863 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1455148160, now seen corresponding path program 1 times [2019-11-24 04:41:51,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:51,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011240660] [2019-11-24 04:41:51,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:52,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011240660] [2019-11-24 04:41:52,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:52,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:52,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417479354] [2019-11-24 04:41:52,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:52,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:52,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:52,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:52,078 INFO L87 Difference]: Start difference. First operand 2696 states and 4318 transitions. Second operand 6 states. [2019-11-24 04:41:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:53,864 INFO L93 Difference]: Finished difference Result 8674 states and 14243 transitions. [2019-11-24 04:41:53,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:53,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-24 04:41:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:53,873 INFO L225 Difference]: With dead ends: 8674 [2019-11-24 04:41:53,873 INFO L226 Difference]: Without dead ends: 6193 [2019-11-24 04:41:53,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:41:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6193 states. [2019-11-24 04:41:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6193 to 3112. [2019-11-24 04:41:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-11-24 04:41:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 5028 transitions. [2019-11-24 04:41:54,494 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 5028 transitions. Word has length 67 [2019-11-24 04:41:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:54,495 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 5028 transitions. [2019-11-24 04:41:54,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 5028 transitions. [2019-11-24 04:41:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:54,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:54,498 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:41:54,498 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash -479504781, now seen corresponding path program 1 times [2019-11-24 04:41:54,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:54,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100320428] [2019-11-24 04:41:54,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:55,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100320428] [2019-11-24 04:41:55,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853561919] [2019-11-24 04:41:55,203 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 04:41:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:55,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:41:55,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:41:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:55,732 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:41:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639785543] [2019-11-24 04:41:55,886 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2019-11-24 04:41:55,886 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:41:55,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:41:55,900 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:41:55,900 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs