/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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:19:04,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:19:04,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:19:04,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:19:04,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:19:04,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:19:04,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:19:04,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:19:04,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:19:04,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:19:04,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:19:04,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:19:04,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:19:04,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:19:04,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:19:04,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:19:04,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:19:04,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:19:04,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:19:04,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:19:04,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:19:04,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:19:04,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:19:04,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:19:04,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:19:04,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:19:04,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:19:04,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:19:04,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:19:04,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:19:04,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:19:04,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:19:04,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:19:04,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:19:04,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:19:04,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:19:04,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:19:04,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:19:04,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:19:04,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:19:04,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:19:04,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:19:04,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:19:04,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:19:04,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:19:04,853 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:19:04,854 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:19:04,854 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:19:04,854 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:19:04,855 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:19:04,855 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:19:04,855 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:19:04,856 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:19:04,856 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:19:04,856 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:19:04,857 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:19:04,857 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:19:04,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:19:04,858 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:19:04,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:19:04,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:19:04,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:19:04,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:19:04,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:19:04,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:19:04,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:19:04,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:19:04,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:19:04,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:19:04,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:19:04,862 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:19:04,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:19:04,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:19:04,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:19:04,864 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:19:05,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:19:05,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:19:05,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:19:05,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:19:05,147 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:19:05,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-24 04:19:05,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a344b81c/a2033b28dd4d4300a59a9e87b98b5823/FLAG6a37fd73b [2019-11-24 04:19:05,686 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:19:05,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-24 04:19:05,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a344b81c/a2033b28dd4d4300a59a9e87b98b5823/FLAG6a37fd73b [2019-11-24 04:19:06,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a344b81c/a2033b28dd4d4300a59a9e87b98b5823 [2019-11-24 04:19:06,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:19:06,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:19:06,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:19:06,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:19:06,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:19:06,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fff4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06, skipping insertion in model container [2019-11-24 04:19:06,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:19:06,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:19:06,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:19:06,323 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:19:06,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:19:06,371 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:19:06,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06 WrapperNode [2019-11-24 04:19:06,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:19:06,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:19:06,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:19:06,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:19:06,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:19:06,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:19:06,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:19:06,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:19:06,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... [2019-11-24 04:19:06,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:19:06,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:19:06,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:19:06,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:19:06,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:19:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:19:06,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:19:07,048 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:19:07,048 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:19:07,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:07 BoogieIcfgContainer [2019-11-24 04:19:07,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:19:07,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:19:07,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:19:07,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:19:07,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:19:06" (1/3) ... [2019-11-24 04:19:07,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c9303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:07, skipping insertion in model container [2019-11-24 04:19:07,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:19:06" (2/3) ... [2019-11-24 04:19:07,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c9303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:19:07, skipping insertion in model container [2019-11-24 04:19:07,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:19:07" (3/3) ... [2019-11-24 04:19:07,057 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-24 04:19:07,067 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:19:07,074 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-24 04:19:07,085 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-24 04:19:07,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:19:07,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:19:07,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:19:07,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:19:07,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:19:07,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:19:07,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:19:07,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:19:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-24 04:19:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:19:07,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:07,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:07,140 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash -101219053, now seen corresponding path program 1 times [2019-11-24 04:19:07,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:07,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384496449] [2019-11-24 04:19:07,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:07,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384496449] [2019-11-24 04:19:07,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:07,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:07,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703023868] [2019-11-24 04:19:07,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:07,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:07,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:07,368 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-24 04:19:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:07,567 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2019-11-24 04:19:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:07,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:19:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:07,583 INFO L225 Difference]: With dead ends: 122 [2019-11-24 04:19:07,583 INFO L226 Difference]: Without dead ends: 106 [2019-11-24 04:19:07,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-24 04:19:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 68. [2019-11-24 04:19:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-24 04:19:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-24 04:19:07,628 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2019-11-24 04:19:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:07,628 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-24 04:19:07,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-24 04:19:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:19:07,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:07,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:07,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -104789997, now seen corresponding path program 1 times [2019-11-24 04:19:07,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:07,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762600925] [2019-11-24 04:19:07,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:07,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762600925] [2019-11-24 04:19:07,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:07,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:07,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396068398] [2019-11-24 04:19:07,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:07,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:07,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:07,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:07,675 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2019-11-24 04:19:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:07,781 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2019-11-24 04:19:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:07,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:19:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:07,783 INFO L225 Difference]: With dead ends: 106 [2019-11-24 04:19:07,783 INFO L226 Difference]: Without dead ends: 104 [2019-11-24 04:19:07,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-24 04:19:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2019-11-24 04:19:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 04:19:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-24 04:19:07,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2019-11-24 04:19:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:07,795 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-24 04:19:07,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-24 04:19:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:19:07,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:07,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:07,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash -345778017, now seen corresponding path program 1 times [2019-11-24 04:19:07,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:07,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107985782] [2019-11-24 04:19:07,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:07,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107985782] [2019-11-24 04:19:07,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:07,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:07,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657375139] [2019-11-24 04:19:07,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:07,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:07,907 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-11-24 04:19:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,041 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-24 04:19:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:08,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-24 04:19:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,043 INFO L225 Difference]: With dead ends: 68 [2019-11-24 04:19:08,043 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:19:08,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:19:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-24 04:19:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 04:19:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 04:19:08,051 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 10 [2019-11-24 04:19:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,051 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 04:19:08,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 04:19:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:19:08,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash 646297484, now seen corresponding path program 1 times [2019-11-24 04:19:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388389] [2019-11-24 04:19:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:08,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388389] [2019-11-24 04:19:08,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:08,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045564490] [2019-11-24 04:19:08,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:08,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:08,114 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-24 04:19:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,214 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-24 04:19:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:08,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-24 04:19:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,216 INFO L225 Difference]: With dead ends: 66 [2019-11-24 04:19:08,216 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 04:19:08,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 04:19:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-24 04:19:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 04:19:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 04:19:08,223 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 10 [2019-11-24 04:19:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,223 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 04:19:08,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 04:19:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:08,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,225 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2129179748, now seen corresponding path program 1 times [2019-11-24 04:19:08,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720049568] [2019-11-24 04:19:08,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:08,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720049568] [2019-11-24 04:19:08,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:08,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440577172] [2019-11-24 04:19:08,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:08,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:08,299 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-24 04:19:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,374 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 04:19:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:08,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:19:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,375 INFO L225 Difference]: With dead ends: 64 [2019-11-24 04:19:08,376 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 04:19:08,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 04:19:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-24 04:19:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-24 04:19:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-24 04:19:08,382 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 11 [2019-11-24 04:19:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,382 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-24 04:19:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-24 04:19:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:08,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2128691176, now seen corresponding path program 1 times [2019-11-24 04:19:08,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380865967] [2019-11-24 04:19:08,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:08,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380865967] [2019-11-24 04:19:08,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:08,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017579699] [2019-11-24 04:19:08,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:08,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:08,452 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2019-11-24 04:19:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,558 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-24 04:19:08,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:08,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-24 04:19:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,560 INFO L225 Difference]: With dead ends: 94 [2019-11-24 04:19:08,562 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 04:19:08,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 04:19:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-24 04:19:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-24 04:19:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-24 04:19:08,575 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2019-11-24 04:19:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,576 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-24 04:19:08,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-24 04:19:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:08,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2128675288, now seen corresponding path program 1 times [2019-11-24 04:19:08,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724207386] [2019-11-24 04:19:08,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:08,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724207386] [2019-11-24 04:19:08,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:08,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968034595] [2019-11-24 04:19:08,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:08,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:08,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:08,665 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2019-11-24 04:19:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,788 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-24 04:19:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:08,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-24 04:19:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,789 INFO L225 Difference]: With dead ends: 99 [2019-11-24 04:19:08,789 INFO L226 Difference]: Without dead ends: 97 [2019-11-24 04:19:08,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-24 04:19:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 54. [2019-11-24 04:19:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-24 04:19:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-24 04:19:08,795 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 11 [2019-11-24 04:19:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,796 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-24 04:19:08,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-24 04:19:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:19:08,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,797 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1439610404, now seen corresponding path program 1 times [2019-11-24 04:19:08,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668659337] [2019-11-24 04:19:08,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668659337] [2019-11-24 04:19:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:08,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:08,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308570243] [2019-11-24 04:19:08,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:08,843 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2019-11-24 04:19:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:08,897 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-24 04:19:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:08,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:19:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:08,899 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:19:08,899 INFO L226 Difference]: Without dead ends: 52 [2019-11-24 04:19:08,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-24 04:19:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-24 04:19:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-24 04:19:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-24 04:19:08,909 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-11-24 04:19:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:08,909 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-24 04:19:08,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-24 04:19:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:08,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:08,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:08,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1564912810, now seen corresponding path program 1 times [2019-11-24 04:19:08,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:08,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873325100] [2019-11-24 04:19:08,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:09,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873325100] [2019-11-24 04:19:09,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:09,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:09,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055165047] [2019-11-24 04:19:09,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:09,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:09,054 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-11-24 04:19:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,172 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-24 04:19:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:09,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:19:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,174 INFO L225 Difference]: With dead ends: 81 [2019-11-24 04:19:09,174 INFO L226 Difference]: Without dead ends: 79 [2019-11-24 04:19:09,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-24 04:19:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2019-11-24 04:19:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-24 04:19:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-24 04:19:09,179 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2019-11-24 04:19:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,180 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-24 04:19:09,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-24 04:19:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:09,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,181 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1564420266, now seen corresponding path program 1 times [2019-11-24 04:19:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379515056] [2019-11-24 04:19:09,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:09,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379515056] [2019-11-24 04:19:09,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:09,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:09,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757054516] [2019-11-24 04:19:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:09,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:09,311 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-24 04:19:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,444 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-11-24 04:19:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:09,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:19:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,445 INFO L225 Difference]: With dead ends: 85 [2019-11-24 04:19:09,445 INFO L226 Difference]: Without dead ends: 83 [2019-11-24 04:19:09,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:19:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-24 04:19:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 46. [2019-11-24 04:19:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-24 04:19:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-24 04:19:09,454 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2019-11-24 04:19:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,455 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-24 04:19:09,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-24 04:19:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:09,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1661195103, now seen corresponding path program 1 times [2019-11-24 04:19:09,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582104691] [2019-11-24 04:19:09,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:09,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582104691] [2019-11-24 04:19:09,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:09,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:09,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384693820] [2019-11-24 04:19:09,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:09,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:09,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:09,486 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-24 04:19:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,554 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-24 04:19:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:09,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-24 04:19:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,556 INFO L225 Difference]: With dead ends: 65 [2019-11-24 04:19:09,556 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:19:09,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:19:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-11-24 04:19:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-24 04:19:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-24 04:19:09,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 12 [2019-11-24 04:19:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-24 04:19:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-24 04:19:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:19:09,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,562 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1659471199, now seen corresponding path program 1 times [2019-11-24 04:19:09,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019712992] [2019-11-24 04:19:09,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:09,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019712992] [2019-11-24 04:19:09,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:09,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:09,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257412242] [2019-11-24 04:19:09,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:09,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:09,679 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2019-11-24 04:19:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,750 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-24 04:19:09,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:09,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 04:19:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,752 INFO L225 Difference]: With dead ends: 46 [2019-11-24 04:19:09,752 INFO L226 Difference]: Without dead ends: 44 [2019-11-24 04:19:09,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-24 04:19:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-24 04:19:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-24 04:19:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-24 04:19:09,756 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2019-11-24 04:19:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,757 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-24 04:19:09,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-24 04:19:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:09,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,758 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 42563455, now seen corresponding path program 1 times [2019-11-24 04:19:09,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175393261] [2019-11-24 04:19:09,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:09,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175393261] [2019-11-24 04:19:09,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:09,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:09,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652083397] [2019-11-24 04:19:09,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:09,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:09,844 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-24 04:19:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:09,932 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-11-24 04:19:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:09,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:09,933 INFO L225 Difference]: With dead ends: 58 [2019-11-24 04:19:09,934 INFO L226 Difference]: Without dead ends: 56 [2019-11-24 04:19:09,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-24 04:19:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-11-24 04:19:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-24 04:19:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-24 04:19:09,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2019-11-24 04:19:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:09,941 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-24 04:19:09,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-24 04:19:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:09,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:09,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:09,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 44110600, now seen corresponding path program 1 times [2019-11-24 04:19:09,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:09,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8389410] [2019-11-24 04:19:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:10,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8389410] [2019-11-24 04:19:10,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:10,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114553964] [2019-11-24 04:19:10,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:10,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:10,048 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-11-24 04:19:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,123 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-24 04:19:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:10,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:19:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,125 INFO L225 Difference]: With dead ends: 60 [2019-11-24 04:19:10,125 INFO L226 Difference]: Without dead ends: 58 [2019-11-24 04:19:10,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-24 04:19:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2019-11-24 04:19:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 04:19:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-24 04:19:10,129 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 13 [2019-11-24 04:19:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,130 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-24 04:19:10,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-24 04:19:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:19:10,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:10,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:10,133 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash 96004535, now seen corresponding path program 1 times [2019-11-24 04:19:10,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:10,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126212179] [2019-11-24 04:19:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:10,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126212179] [2019-11-24 04:19:10,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:10,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532829826] [2019-11-24 04:19:10,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:10,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:10,192 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-11-24 04:19:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,252 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-24 04:19:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:19:10,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:19:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,253 INFO L225 Difference]: With dead ends: 38 [2019-11-24 04:19:10,253 INFO L226 Difference]: Without dead ends: 34 [2019-11-24 04:19:10,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-24 04:19:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-24 04:19:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-24 04:19:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-24 04:19:10,256 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2019-11-24 04:19:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,257 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-24 04:19:10,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-24 04:19:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:19:10,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:10,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:10,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1367432731, now seen corresponding path program 1 times [2019-11-24 04:19:10,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:10,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991511236] [2019-11-24 04:19:10,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:10,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991511236] [2019-11-24 04:19:10,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:19:10,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597664145] [2019-11-24 04:19:10,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:19:10,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:19:10,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:10,306 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-11-24 04:19:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,395 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-24 04:19:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:10,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-24 04:19:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,396 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:19:10,396 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 04:19:10,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 04:19:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-11-24 04:19:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 04:19:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-24 04:19:10,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2019-11-24 04:19:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,400 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-24 04:19:10,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:19:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-24 04:19:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:19:10,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:10,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:10,401 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:10,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2046065374, now seen corresponding path program 1 times [2019-11-24 04:19:10,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:10,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083482967] [2019-11-24 04:19:10,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:10,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083482967] [2019-11-24 04:19:10,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:19:10,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405865182] [2019-11-24 04:19:10,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:19:10,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:19:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:19:10,436 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-11-24 04:19:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,526 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-24 04:19:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:19:10,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 04:19:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,529 INFO L225 Difference]: With dead ends: 51 [2019-11-24 04:19:10,529 INFO L226 Difference]: Without dead ends: 49 [2019-11-24 04:19:10,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:19:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-24 04:19:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2019-11-24 04:19:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-24 04:19:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-24 04:19:10,533 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2019-11-24 04:19:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,534 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-24 04:19:10,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:19:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-24 04:19:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:19:10,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:10,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:19:10,535 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 996486959, now seen corresponding path program 1 times [2019-11-24 04:19:10,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:10,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273932962] [2019-11-24 04:19:10,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:10,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273932962] [2019-11-24 04:19:10,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:19:10,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:19:10,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219708017] [2019-11-24 04:19:10,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:19:10,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:19:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:19:10,560 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-11-24 04:19:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,601 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-24 04:19:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:19:10,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:19:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,601 INFO L225 Difference]: With dead ends: 32 [2019-11-24 04:19:10,601 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:19:10,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:19:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:19:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:19:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:19:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:19:10,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-11-24 04:19:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,603 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:19:10,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:19:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:19:10,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:19:10,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:19:11,018 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 8 [2019-11-24 04:19:11,044 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-24 04:19:11,044 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-24 04:19:11,044 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-24 04:19:11,045 INFO L444 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-24 04:19:11,046 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-24 04:19:11,046 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:19:11,046 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-24 04:19:11,046 INFO L447 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-24 04:19:11,046 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-24 04:19:11,046 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-24 04:19:11,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-24 04:19:11,048 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-24 04:19:11,048 INFO L440 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-24 04:19:11,048 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-24 04:19:11,048 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-24 04:19:11,048 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-24 04:19:11,048 INFO L444 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-24 04:19:11,049 INFO L444 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-24 04:19:11,050 INFO L447 ceAbstractionStarter]: At program point L395(lines 10 397) the Hoare annotation is: true [2019-11-24 04:19:11,051 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-24 04:19:11,051 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-24 04:19:11,051 INFO L440 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-24 04:19:11,051 INFO L440 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:11,051 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-24 04:19:11,051 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-24 04:19:11,052 INFO L440 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-24 04:19:11,053 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-24 04:19:11,054 INFO L444 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-24 04:19:11,054 INFO L444 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-24 04:19:11,054 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-24 04:19:11,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-24 04:19:11,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:19:11 BoogieIcfgContainer [2019-11-24 04:19:11,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:19:11,075 INFO L168 Benchmark]: Toolchain (without parser) took 5054.63 ms. Allocated memory was 145.8 MB in the beginning and 278.9 MB in the end (delta: 133.2 MB). Free memory was 102.7 MB in the beginning and 233.4 MB in the end (delta: -130.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,076 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.00 ms. Allocated memory is still 145.8 MB. Free memory was 102.3 MB in the beginning and 89.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.91 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 89.5 MB in the beginning and 180.7 MB in the end (delta: -91.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,078 INFO L168 Benchmark]: Boogie Preprocessor took 23.34 ms. Allocated memory is still 203.4 MB. Free memory was 180.7 MB in the beginning and 178.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,079 INFO L168 Benchmark]: RCFGBuilder took 512.49 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 153.1 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,080 INFO L168 Benchmark]: TraceAbstraction took 4022.76 ms. Allocated memory was 203.4 MB in the beginning and 278.9 MB in the end (delta: 75.5 MB). Free memory was 153.1 MB in the beginning and 233.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:19:11,083 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.00 ms. Allocated memory is still 145.8 MB. Free memory was 102.3 MB in the beginning and 89.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 140.91 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 89.5 MB in the beginning and 180.7 MB in the end (delta: -91.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.34 ms. Allocated memory is still 203.4 MB. Free memory was 180.7 MB in the beginning and 178.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 512.49 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 153.1 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4022.76 ms. Allocated memory was 203.4 MB in the beginning and 278.9 MB in the end (delta: 75.5 MB). Free memory was 153.1 MB in the beginning and 233.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 18 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 752 SDtfs, 1452 SDslu, 711 SDs, 0 SdLazy, 1128 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 322 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 40 HoareAnnotationTreeSize, 6 FomulaSimplifications, 832292 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 18720 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 6580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...