/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:48:41,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:48:41,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:48:41,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:48:41,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:48:41,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:48:41,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:48:41,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:48:41,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:48:41,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:48:41,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:48:41,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:48:41,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:48:41,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:48:41,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:48:41,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:48:41,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:48:41,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:48:41,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:48:41,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:48:41,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:48:41,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:48:41,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:48:41,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:48:41,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:48:41,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:48:41,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:48:41,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:48:41,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:48:41,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:48:41,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:48:41,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:48:41,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:48:41,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:48:41,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:48:41,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:48:41,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:48:41,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:48:41,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:48:41,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:48:41,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:48:41,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:48:41,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:48:41,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:48:41,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:48:41,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:48:41,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:48:41,843 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:48:41,844 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:48:41,844 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:48:41,844 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:48:41,844 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:48:41,844 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:48:41,845 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:48:41,845 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:48:41,845 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:48:41,845 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:48:41,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:48:41,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:48:41,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:48:41,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:48:41,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:48:41,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:48:41,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:48:41,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:48:41,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:48:41,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:41,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:48:41,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:48:41,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:48:41,849 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:48:41,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:48:41,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:48:41,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:48:41,850 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:48:42,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:48:42,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:48:42,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:48:42,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:48:42,196 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:48:42,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:48:42,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6ccf3d1/06e6379b196048b3b78e42d61f585ddd/FLAGc1798ddad [2019-11-24 05:48:42,899 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:48:42,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:48:42,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6ccf3d1/06e6379b196048b3b78e42d61f585ddd/FLAGc1798ddad [2019-11-24 05:48:43,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6ccf3d1/06e6379b196048b3b78e42d61f585ddd [2019-11-24 05:48:43,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:48:43,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:48:43,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:43,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:48:43,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:48:43,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:43" (1/1) ... [2019-11-24 05:48:43,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d0b56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:43, skipping insertion in model container [2019-11-24 05:48:43,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:43" (1/1) ... [2019-11-24 05:48:43,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:48:43,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:48:43,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:43,967 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:48:44,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:44,413 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:48:44,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44 WrapperNode [2019-11-24 05:48:44,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:44,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:44,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:48:44,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:48:44,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:44,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:48:44,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:48:44,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:48:44,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... [2019-11-24 05:48:44,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:48:44,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:48:44,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:48:44,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:48:44,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:48:44,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:48:47,662 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:48:47,662 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:48:47,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:47 BoogieIcfgContainer [2019-11-24 05:48:47,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:48:47,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:48:47,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:48:47,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:48:47,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:48:43" (1/3) ... [2019-11-24 05:48:47,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abbfb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:47, skipping insertion in model container [2019-11-24 05:48:47,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:44" (2/3) ... [2019-11-24 05:48:47,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abbfb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:47, skipping insertion in model container [2019-11-24 05:48:47,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:47" (3/3) ... [2019-11-24 05:48:47,674 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:48:47,684 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:48:47,694 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 05:48:47,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 05:48:47,752 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:48:47,753 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:48:47,753 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:48:47,753 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:48:47,753 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:48:47,753 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:48:47,753 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:48:47,754 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:48:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states. [2019-11-24 05:48:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-24 05:48:47,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:47,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:47,809 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 05:48:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1235189147, now seen corresponding path program 1 times [2019-11-24 05:48:47,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:47,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977273759] [2019-11-24 05:48:47,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:48,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977273759] [2019-11-24 05:48:48,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:48,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:48,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466621964] [2019-11-24 05:48:48,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:48,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:48,982 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 5 states. [2019-11-24 05:48:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:49,200 INFO L93 Difference]: Finished difference Result 813 states and 1434 transitions. [2019-11-24 05:48:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:49,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-11-24 05:48:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:49,233 INFO L225 Difference]: With dead ends: 813 [2019-11-24 05:48:49,233 INFO L226 Difference]: Without dead ends: 569 [2019-11-24 05:48:49,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-11-24 05:48:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 547. [2019-11-24 05:48:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-11-24 05:48:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2019-11-24 05:48:49,371 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 119 [2019-11-24 05:48:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:49,372 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2019-11-24 05:48:49,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2019-11-24 05:48:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 05:48:49,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:49,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:49,383 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 05:48:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1119697784, now seen corresponding path program 1 times [2019-11-24 05:48:49,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:49,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671032988] [2019-11-24 05:48:49,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:49,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671032988] [2019-11-24 05:48:49,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:49,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:49,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209435362] [2019-11-24 05:48:49,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:49,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:49,513 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand 3 states. [2019-11-24 05:48:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:49,628 INFO L93 Difference]: Finished difference Result 1168 states and 1575 transitions. [2019-11-24 05:48:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:49,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-24 05:48:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:49,633 INFO L225 Difference]: With dead ends: 1168 [2019-11-24 05:48:49,633 INFO L226 Difference]: Without dead ends: 721 [2019-11-24 05:48:49,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-11-24 05:48:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 657. [2019-11-24 05:48:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-24 05:48:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 906 transitions. [2019-11-24 05:48:49,671 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 906 transitions. Word has length 121 [2019-11-24 05:48:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:49,674 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 906 transitions. [2019-11-24 05:48:49,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 906 transitions. [2019-11-24 05:48:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-24 05:48:49,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:49,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:49,684 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 05:48:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1649835319, now seen corresponding path program 1 times [2019-11-24 05:48:49,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:49,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494689435] [2019-11-24 05:48:49,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:49,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494689435] [2019-11-24 05:48:49,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:49,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:49,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110702435] [2019-11-24 05:48:49,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:49,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:49,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:49,790 INFO L87 Difference]: Start difference. First operand 657 states and 906 transitions. Second operand 3 states. [2019-11-24 05:48:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:49,877 INFO L93 Difference]: Finished difference Result 1554 states and 2207 transitions. [2019-11-24 05:48:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:49,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-24 05:48:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:49,887 INFO L225 Difference]: With dead ends: 1554 [2019-11-24 05:48:49,887 INFO L226 Difference]: Without dead ends: 943 [2019-11-24 05:48:49,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-24 05:48:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 855. [2019-11-24 05:48:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-24 05:48:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1226 transitions. [2019-11-24 05:48:49,944 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1226 transitions. Word has length 121 [2019-11-24 05:48:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:49,945 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1226 transitions. [2019-11-24 05:48:49,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1226 transitions. [2019-11-24 05:48:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 05:48:49,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:49,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:49,949 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 05:48:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:49,949 INFO L82 PathProgramCache]: Analyzing trace with hash 692825629, now seen corresponding path program 1 times [2019-11-24 05:48:49,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:49,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082013463] [2019-11-24 05:48:49,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:50,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082013463] [2019-11-24 05:48:50,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:50,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:50,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065106878] [2019-11-24 05:48:50,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:50,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:50,150 INFO L87 Difference]: Start difference. First operand 855 states and 1226 transitions. Second operand 5 states. [2019-11-24 05:48:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:50,378 INFO L93 Difference]: Finished difference Result 1614 states and 2325 transitions. [2019-11-24 05:48:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:50,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-24 05:48:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:50,384 INFO L225 Difference]: With dead ends: 1614 [2019-11-24 05:48:50,384 INFO L226 Difference]: Without dead ends: 855 [2019-11-24 05:48:50,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-24 05:48:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-24 05:48:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-24 05:48:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1214 transitions. [2019-11-24 05:48:50,431 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1214 transitions. Word has length 124 [2019-11-24 05:48:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:50,431 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1214 transitions. [2019-11-24 05:48:50,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1214 transitions. [2019-11-24 05:48:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 05:48:50,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:50,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:50,434 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 05:48:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash -604054856, now seen corresponding path program 1 times [2019-11-24 05:48:50,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:50,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515397246] [2019-11-24 05:48:50,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:50,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515397246] [2019-11-24 05:48:50,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:50,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:50,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474326084] [2019-11-24 05:48:50,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:48:50,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:48:50,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:48:50,924 INFO L87 Difference]: Start difference. First operand 855 states and 1214 transitions. Second operand 6 states. [2019-11-24 05:48:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:51,456 INFO L93 Difference]: Finished difference Result 3479 states and 5144 transitions. [2019-11-24 05:48:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:48:51,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-11-24 05:48:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:51,473 INFO L225 Difference]: With dead ends: 3479 [2019-11-24 05:48:51,474 INFO L226 Difference]: Without dead ends: 2835 [2019-11-24 05:48:51,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-11-24 05:48:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2083. [2019-11-24 05:48:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-11-24 05:48:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2970 transitions. [2019-11-24 05:48:51,644 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2970 transitions. Word has length 124 [2019-11-24 05:48:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:51,646 INFO L462 AbstractCegarLoop]: Abstraction has 2083 states and 2970 transitions. [2019-11-24 05:48:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:48:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2970 transitions. [2019-11-24 05:48:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 05:48:51,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:51,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:51,649 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 05:48:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1424378340, now seen corresponding path program 1 times [2019-11-24 05:48:51,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:51,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145395008] [2019-11-24 05:48:51,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:52,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145395008] [2019-11-24 05:48:52,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:52,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:52,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906100157] [2019-11-24 05:48:52,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:52,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:52,055 INFO L87 Difference]: Start difference. First operand 2083 states and 2970 transitions. Second operand 5 states. [2019-11-24 05:48:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:52,375 INFO L93 Difference]: Finished difference Result 5943 states and 8466 transitions. [2019-11-24 05:48:52,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:52,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-24 05:48:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:52,393 INFO L225 Difference]: With dead ends: 5943 [2019-11-24 05:48:52,394 INFO L226 Difference]: Without dead ends: 3954 [2019-11-24 05:48:52,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2019-11-24 05:48:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3932. [2019-11-24 05:48:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3932 states. [2019-11-24 05:48:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5573 transitions. [2019-11-24 05:48:52,818 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5573 transitions. Word has length 124 [2019-11-24 05:48:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:52,819 INFO L462 AbstractCegarLoop]: Abstraction has 3932 states and 5573 transitions. [2019-11-24 05:48:52,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5573 transitions. [2019-11-24 05:48:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-24 05:48:52,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:52,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:52,833 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 05:48:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 643376563, now seen corresponding path program 1 times [2019-11-24 05:48:52,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:52,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458805196] [2019-11-24 05:48:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:52,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458805196] [2019-11-24 05:48:52,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:52,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:52,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661873850] [2019-11-24 05:48:52,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:52,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:52,937 INFO L87 Difference]: Start difference. First operand 3932 states and 5573 transitions. Second operand 3 states. [2019-11-24 05:48:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:53,490 INFO L93 Difference]: Finished difference Result 9829 states and 14261 transitions. [2019-11-24 05:48:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:53,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-24 05:48:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:53,531 INFO L225 Difference]: With dead ends: 9829 [2019-11-24 05:48:53,531 INFO L226 Difference]: Without dead ends: 6128 [2019-11-24 05:48:53,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6128 states. [2019-11-24 05:48:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6128 to 5786. [2019-11-24 05:48:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5786 states. [2019-11-24 05:48:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 8529 transitions. [2019-11-24 05:48:54,216 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 8529 transitions. Word has length 126 [2019-11-24 05:48:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:54,216 INFO L462 AbstractCegarLoop]: Abstraction has 5786 states and 8529 transitions. [2019-11-24 05:48:54,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 8529 transitions. [2019-11-24 05:48:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-24 05:48:54,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:54,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:54,221 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 05:48:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2146787639, now seen corresponding path program 1 times [2019-11-24 05:48:54,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:54,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24854641] [2019-11-24 05:48:54,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:54,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24854641] [2019-11-24 05:48:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:54,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440087678] [2019-11-24 05:48:54,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:54,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:54,339 INFO L87 Difference]: Start difference. First operand 5786 states and 8529 transitions. Second operand 3 states. [2019-11-24 05:48:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:55,171 INFO L93 Difference]: Finished difference Result 11161 states and 16498 transitions. [2019-11-24 05:48:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:55,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-24 05:48:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:55,233 INFO L225 Difference]: With dead ends: 11161 [2019-11-24 05:48:55,234 INFO L226 Difference]: Without dead ends: 8567 [2019-11-24 05:48:55,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-11-24 05:48:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8545. [2019-11-24 05:48:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2019-11-24 05:48:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 12472 transitions. [2019-11-24 05:48:56,250 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 12472 transitions. Word has length 129 [2019-11-24 05:48:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:56,251 INFO L462 AbstractCegarLoop]: Abstraction has 8545 states and 12472 transitions. [2019-11-24 05:48:56,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 12472 transitions. [2019-11-24 05:48:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-24 05:48:56,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:56,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:56,259 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 05:48:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash -895934208, now seen corresponding path program 1 times [2019-11-24 05:48:56,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:56,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596716598] [2019-11-24 05:48:56,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:56,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596716598] [2019-11-24 05:48:56,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:56,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:56,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515550589] [2019-11-24 05:48:56,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:56,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:56,395 INFO L87 Difference]: Start difference. First operand 8545 states and 12472 transitions. Second operand 5 states. [2019-11-24 05:48:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:57,543 INFO L93 Difference]: Finished difference Result 17011 states and 24849 transitions. [2019-11-24 05:48:57,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:57,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-11-24 05:48:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:57,587 INFO L225 Difference]: With dead ends: 17011 [2019-11-24 05:48:57,588 INFO L226 Difference]: Without dead ends: 8545 [2019-11-24 05:48:57,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8545 states. [2019-11-24 05:48:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8545 to 8545. [2019-11-24 05:48:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2019-11-24 05:48:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 12329 transitions. [2019-11-24 05:48:58,522 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 12329 transitions. Word has length 129 [2019-11-24 05:48:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:58,523 INFO L462 AbstractCegarLoop]: Abstraction has 8545 states and 12329 transitions. [2019-11-24 05:48:58,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 12329 transitions. [2019-11-24 05:48:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-24 05:48:58,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:58,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:58,534 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 05:48:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1739306043, now seen corresponding path program 1 times [2019-11-24 05:48:58,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:58,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539077890] [2019-11-24 05:48:58,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:59,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539077890] [2019-11-24 05:48:59,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:59,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:59,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141639845] [2019-11-24 05:48:59,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:59,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:59,019 INFO L87 Difference]: Start difference. First operand 8545 states and 12329 transitions. Second operand 5 states. [2019-11-24 05:48:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:59,649 INFO L93 Difference]: Finished difference Result 8573 states and 12351 transitions. [2019-11-24 05:48:59,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:59,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-11-24 05:48:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:59,671 INFO L225 Difference]: With dead ends: 8573 [2019-11-24 05:48:59,671 INFO L226 Difference]: Without dead ends: 5889 [2019-11-24 05:48:59,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5889 states. [2019-11-24 05:49:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5889 to 5867. [2019-11-24 05:49:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5867 states. [2019-11-24 05:49:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 8418 transitions. [2019-11-24 05:49:00,758 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 8418 transitions. Word has length 129 [2019-11-24 05:49:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:00,759 INFO L462 AbstractCegarLoop]: Abstraction has 5867 states and 8418 transitions. [2019-11-24 05:49:00,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 8418 transitions. [2019-11-24 05:49:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:00,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:00,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:00,767 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 05:49:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1532607422, now seen corresponding path program 1 times [2019-11-24 05:49:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207464138] [2019-11-24 05:49:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:01,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207464138] [2019-11-24 05:49:01,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:01,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:49:01,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792447869] [2019-11-24 05:49:01,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:49:01,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:49:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:01,568 INFO L87 Difference]: Start difference. First operand 5867 states and 8418 transitions. Second operand 12 states. [2019-11-24 05:49:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:06,432 INFO L93 Difference]: Finished difference Result 30813 states and 46528 transitions. [2019-11-24 05:49:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:49:06,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-11-24 05:49:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:06,508 INFO L225 Difference]: With dead ends: 30813 [2019-11-24 05:49:06,508 INFO L226 Difference]: Without dead ends: 27953 [2019-11-24 05:49:06,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:49:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27953 states. [2019-11-24 05:49:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27953 to 19031. [2019-11-24 05:49:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19031 states. [2019-11-24 05:49:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19031 states to 19031 states and 28648 transitions. [2019-11-24 05:49:08,380 INFO L78 Accepts]: Start accepts. Automaton has 19031 states and 28648 transitions. Word has length 134 [2019-11-24 05:49:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:08,381 INFO L462 AbstractCegarLoop]: Abstraction has 19031 states and 28648 transitions. [2019-11-24 05:49:08,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:49:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 19031 states and 28648 transitions. [2019-11-24 05:49:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:08,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:08,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:08,388 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 05:49:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 495825774, now seen corresponding path program 1 times [2019-11-24 05:49:08,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:08,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417953873] [2019-11-24 05:49:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:08,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417953873] [2019-11-24 05:49:08,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:08,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:08,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914653522] [2019-11-24 05:49:08,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:08,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:08,920 INFO L87 Difference]: Start difference. First operand 19031 states and 28648 transitions. Second operand 5 states. [2019-11-24 05:49:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:10,324 INFO L93 Difference]: Finished difference Result 26781 states and 40421 transitions. [2019-11-24 05:49:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:10,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-11-24 05:49:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:10,372 INFO L225 Difference]: With dead ends: 26781 [2019-11-24 05:49:10,373 INFO L226 Difference]: Without dead ends: 17992 [2019-11-24 05:49:10,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17992 states. [2019-11-24 05:49:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17992 to 17872. [2019-11-24 05:49:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17872 states. [2019-11-24 05:49:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17872 states to 17872 states and 26997 transitions. [2019-11-24 05:49:11,880 INFO L78 Accepts]: Start accepts. Automaton has 17872 states and 26997 transitions. Word has length 134 [2019-11-24 05:49:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:11,880 INFO L462 AbstractCegarLoop]: Abstraction has 17872 states and 26997 transitions. [2019-11-24 05:49:11,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17872 states and 26997 transitions. [2019-11-24 05:49:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:11,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:11,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:11,887 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 05:49:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1312453044, now seen corresponding path program 1 times [2019-11-24 05:49:11,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:11,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304056221] [2019-11-24 05:49:11,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:13,315 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-24 05:49:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:14,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304056221] [2019-11-24 05:49:14,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-24 05:49:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784918902] [2019-11-24 05:49:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-24 05:49:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-24 05:49:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:49:14,094 INFO L87 Difference]: Start difference. First operand 17872 states and 26997 transitions. Second operand 27 states. [2019-11-24 05:49:14,634 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-24 05:49:14,868 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-24 05:49:15,064 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-24 05:49:15,392 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-24 05:49:15,643 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-11-24 05:49:16,098 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-24 05:49:16,514 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-11-24 05:49:16,885 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-11-24 05:49:17,237 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-11-24 05:49:17,733 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-11-24 05:49:18,124 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-11-24 05:49:18,697 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-11-24 05:49:19,184 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-11-24 05:49:19,556 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-11-24 05:49:19,839 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-11-24 05:49:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:27,039 INFO L93 Difference]: Finished difference Result 42881 states and 65816 transitions. [2019-11-24 05:49:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-24 05:49:27,040 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 134 [2019-11-24 05:49:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:27,123 INFO L225 Difference]: With dead ends: 42881 [2019-11-24 05:49:27,124 INFO L226 Difference]: Without dead ends: 36987 [2019-11-24 05:49:27,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=490, Invalid=2060, Unknown=0, NotChecked=0, Total=2550 [2019-11-24 05:49:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-11-24 05:49:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 17966. [2019-11-24 05:49:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17966 states. [2019-11-24 05:49:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17966 states to 17966 states and 27111 transitions. [2019-11-24 05:49:29,144 INFO L78 Accepts]: Start accepts. Automaton has 17966 states and 27111 transitions. Word has length 134 [2019-11-24 05:49:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:29,145 INFO L462 AbstractCegarLoop]: Abstraction has 17966 states and 27111 transitions. [2019-11-24 05:49:29,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-24 05:49:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 17966 states and 27111 transitions. [2019-11-24 05:49:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:29,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:29,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:29,149 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 05:49:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1959408345, now seen corresponding path program 1 times [2019-11-24 05:49:29,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:29,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881040621] [2019-11-24 05:49:29,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:29,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881040621] [2019-11-24 05:49:29,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:29,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:29,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154021336] [2019-11-24 05:49:29,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:29,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:29,251 INFO L87 Difference]: Start difference. First operand 17966 states and 27111 transitions. Second operand 5 states. [2019-11-24 05:49:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:31,065 INFO L93 Difference]: Finished difference Result 35751 states and 53996 transitions. [2019-11-24 05:49:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:31,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-11-24 05:49:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:31,087 INFO L225 Difference]: With dead ends: 35751 [2019-11-24 05:49:31,088 INFO L226 Difference]: Without dead ends: 17966 [2019-11-24 05:49:31,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17966 states. [2019-11-24 05:49:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17966 to 17966. [2019-11-24 05:49:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17966 states. [2019-11-24 05:49:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17966 states to 17966 states and 26893 transitions. [2019-11-24 05:49:32,866 INFO L78 Accepts]: Start accepts. Automaton has 17966 states and 26893 transitions. Word has length 134 [2019-11-24 05:49:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:32,866 INFO L462 AbstractCegarLoop]: Abstraction has 17966 states and 26893 transitions. [2019-11-24 05:49:32,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 17966 states and 26893 transitions. [2019-11-24 05:49:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:32,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:32,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:32,872 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 05:49:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1065071544, now seen corresponding path program 1 times [2019-11-24 05:49:32,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:32,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98019847] [2019-11-24 05:49:32,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:33,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98019847] [2019-11-24 05:49:33,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:33,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:33,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560091355] [2019-11-24 05:49:33,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:33,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:33,173 INFO L87 Difference]: Start difference. First operand 17966 states and 26893 transitions. Second operand 5 states. [2019-11-24 05:49:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:35,098 INFO L93 Difference]: Finished difference Result 24887 states and 37269 transitions. [2019-11-24 05:49:35,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:35,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-11-24 05:49:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:35,120 INFO L225 Difference]: With dead ends: 24887 [2019-11-24 05:49:35,121 INFO L226 Difference]: Without dead ends: 18008 [2019-11-24 05:49:35,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18008 states. [2019-11-24 05:49:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18008 to 17919. [2019-11-24 05:49:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17919 states. [2019-11-24 05:49:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 26833 transitions. [2019-11-24 05:49:36,887 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 26833 transitions. Word has length 134 [2019-11-24 05:49:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:36,887 INFO L462 AbstractCegarLoop]: Abstraction has 17919 states and 26833 transitions. [2019-11-24 05:49:36,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 26833 transitions. [2019-11-24 05:49:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:36,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:36,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:36,892 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 05:49:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1218726803, now seen corresponding path program 1 times [2019-11-24 05:49:36,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:36,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635206391] [2019-11-24 05:49:36,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:36,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635206391] [2019-11-24 05:49:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:36,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:36,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107640078] [2019-11-24 05:49:36,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:36,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:36,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:36,983 INFO L87 Difference]: Start difference. First operand 17919 states and 26833 transitions. Second operand 3 states. [2019-11-24 05:49:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,690 INFO L93 Difference]: Finished difference Result 30152 states and 45247 transitions. [2019-11-24 05:49:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:39,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 05:49:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,720 INFO L225 Difference]: With dead ends: 30152 [2019-11-24 05:49:39,720 INFO L226 Difference]: Without dead ends: 23962 [2019-11-24 05:49:39,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23962 states. [2019-11-24 05:49:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23962 to 23940. [2019-11-24 05:49:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23940 states. [2019-11-24 05:49:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23940 states to 23940 states and 35545 transitions. [2019-11-24 05:49:41,971 INFO L78 Accepts]: Start accepts. Automaton has 23940 states and 35545 transitions. Word has length 134 [2019-11-24 05:49:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:41,971 INFO L462 AbstractCegarLoop]: Abstraction has 23940 states and 35545 transitions. [2019-11-24 05:49:41,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 23940 states and 35545 transitions. [2019-11-24 05:49:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:41,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:41,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:41,977 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 05:49:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 246097034, now seen corresponding path program 1 times [2019-11-24 05:49:41,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:41,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80823346] [2019-11-24 05:49:41,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:42,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80823346] [2019-11-24 05:49:42,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:42,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347633626] [2019-11-24 05:49:42,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:42,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:42,239 INFO L87 Difference]: Start difference. First operand 23940 states and 35545 transitions. Second operand 5 states. [2019-11-24 05:49:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,151 INFO L93 Difference]: Finished difference Result 37498 states and 56063 transitions. [2019-11-24 05:49:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:44,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-11-24 05:49:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,178 INFO L225 Difference]: With dead ends: 37498 [2019-11-24 05:49:44,178 INFO L226 Difference]: Without dead ends: 21360 [2019-11-24 05:49:44,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21360 states. [2019-11-24 05:49:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21360 to 21338. [2019-11-24 05:49:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21338 states. [2019-11-24 05:49:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21338 states to 21338 states and 31619 transitions. [2019-11-24 05:49:46,175 INFO L78 Accepts]: Start accepts. Automaton has 21338 states and 31619 transitions. Word has length 134 [2019-11-24 05:49:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 21338 states and 31619 transitions. [2019-11-24 05:49:46,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21338 states and 31619 transitions. [2019-11-24 05:49:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 05:49:46,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:46,179 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 05:49:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1548468934, now seen corresponding path program 1 times [2019-11-24 05:49:46,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330292238] [2019-11-24 05:49:46,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,065 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-24 05:49:47,288 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-24 05:49:47,454 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-24 05:49:47,642 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-24 05:49:47,832 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-24 05:49:48,061 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-11-24 05:49:48,256 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-24 05:49:48,455 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-11-24 05:49:48,661 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-11-24 05:49:48,889 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-24 05:49:49,147 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-24 05:49:49,356 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-24 05:49:49,586 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-11-24 05:49:49,818 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-24 05:49:50,028 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-11-24 05:49:50,227 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-11-24 05:49:50,453 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-11-24 05:49:50,699 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-11-24 05:49:50,921 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-24 05:49:51,128 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-11-24 05:49:51,354 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-24 05:49:51,572 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-24 05:49:51,897 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-24 05:49:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:52,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330292238] [2019-11-24 05:49:52,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-11-24 05:49:52,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956794962] [2019-11-24 05:49:52,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-24 05:49:52,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-24 05:49:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-11-24 05:49:52,523 INFO L87 Difference]: Start difference. First operand 21338 states and 31619 transitions. Second operand 32 states. [2019-11-24 05:49:52,932 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-24 05:49:53,250 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-11-24 05:49:53,638 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-11-24 05:49:54,278 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-11-24 05:49:54,992 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-11-24 05:49:55,824 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 100 [2019-11-24 05:49:56,808 WARN L192 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-11-24 05:49:57,770 WARN L192 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2019-11-24 05:49:58,676 WARN L192 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-11-24 05:49:59,585 WARN L192 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2019-11-24 05:50:00,577 WARN L192 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 119 [2019-11-24 05:50:01,912 WARN L192 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 129