/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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:18:19,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:18:19,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:18:19,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:18:19,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:18:19,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:18:19,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:18:19,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:18:19,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:18:19,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:18:19,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:18:19,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:18:19,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:18:19,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:18:19,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:18:19,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:18:19,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:18:19,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:18:19,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:18:19,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:18:19,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:18:19,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:18:19,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:18:19,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:18:19,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:18:19,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:18:19,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:18:19,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:18:19,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:18:19,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:18:19,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:18:19,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:18:19,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:18:19,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:18:19,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:18:19,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:18:19,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:18:19,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:18:19,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:18:19,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:18:19,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:18:19,572 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:18:19,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:18:19,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:18:19,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:18:19,591 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:18:19,591 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:18:19,591 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:18:19,591 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:18:19,592 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:18:19,592 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:18:19,592 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:18:19,592 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:18:19,592 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:18:19,593 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:18:19,593 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:18:19,593 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:18:19,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:18:19,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:18:19,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:18:19,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:18:19,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:18:19,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:18:19,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:18:19,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:18:19,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:18:19,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:18:19,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:18:19,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:18:19,598 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:18:19,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:18:19,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:18:19,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:18:19,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:18:19,879 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:18:19,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-24 04:18:19,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805fe2238/39a4cc82d06c4ae2bfe7b1d67ee0c660/FLAG63e3ba036 [2019-11-24 04:18:20,452 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:18:20,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-24 04:18:20,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805fe2238/39a4cc82d06c4ae2bfe7b1d67ee0c660/FLAG63e3ba036 [2019-11-24 04:18:20,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805fe2238/39a4cc82d06c4ae2bfe7b1d67ee0c660 [2019-11-24 04:18:20,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:18:20,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:18:20,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:20,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:18:20,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:18:20,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:20" (1/1) ... [2019-11-24 04:18:20,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387a7b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:20, skipping insertion in model container [2019-11-24 04:18:20,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:20" (1/1) ... [2019-11-24 04:18:20,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:18:20,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:18:21,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:21,051 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:18:21,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:21,200 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:18:21,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21 WrapperNode [2019-11-24 04:18:21,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:21,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:21,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:18:21,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:18:21,211 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:18:21" (1/1) ... [2019-11-24 04:18:21,217 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:18:21" (1/1) ... [2019-11-24 04:18:21,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:21,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:18:21,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:18:21,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:18:21,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (1/1) ... [2019-11-24 04:18:21,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:18:21,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:18:21,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:18:21,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:18:21,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (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:18:21,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:18:21,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:18:21,747 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:18:21,748 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:18:21,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:21 BoogieIcfgContainer [2019-11-24 04:18:21,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:18:21,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:18:21,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:18:21,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:18:21,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:18:20" (1/3) ... [2019-11-24 04:18:21,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0e6432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:21, skipping insertion in model container [2019-11-24 04:18:21,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:21" (2/3) ... [2019-11-24 04:18:21,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0e6432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:21, skipping insertion in model container [2019-11-24 04:18:21,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:21" (3/3) ... [2019-11-24 04:18:21,757 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-24 04:18:21,766 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:18:21,773 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-24 04:18:21,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-24 04:18:21,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:18:21,807 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:18:21,807 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:18:21,807 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:18:21,807 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:18:21,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:18:21,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:18:21,808 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:18:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2019-11-24 04:18:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:18:21,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:21,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:21,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1750713386, now seen corresponding path program 1 times [2019-11-24 04:18:21,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:21,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995379652] [2019-11-24 04:18:21,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:21,997 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:18:21,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995379652] [2019-11-24 04:18:21,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:21,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:18:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181589751] [2019-11-24 04:18:22,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:18:22,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:18:22,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:22,016 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2019-11-24 04:18:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,051 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2019-11-24 04:18:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:18:22,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 04:18:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,064 INFO L225 Difference]: With dead ends: 79 [2019-11-24 04:18:22,064 INFO L226 Difference]: Without dead ends: 71 [2019-11-24 04:18:22,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-24 04:18:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-11-24 04:18:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-24 04:18:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-24 04:18:22,103 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2019-11-24 04:18:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:22,103 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-24 04:18:22,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:18:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-24 04:18:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:18:22,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:22,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:22,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1562463944, now seen corresponding path program 1 times [2019-11-24 04:18:22,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:22,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483184997] [2019-11-24 04:18:22,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:22,162 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:18:22,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483184997] [2019-11-24 04:18:22,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:22,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697288810] [2019-11-24 04:18:22,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:22,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:22,166 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2019-11-24 04:18:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,267 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-24 04:18:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:22,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 04:18:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,269 INFO L225 Difference]: With dead ends: 72 [2019-11-24 04:18:22,269 INFO L226 Difference]: Without dead ends: 70 [2019-11-24 04:18:22,271 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:18:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-24 04:18:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-24 04:18:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-24 04:18:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-24 04:18:22,280 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 9 [2019-11-24 04:18:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:22,280 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-24 04:18:22,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-24 04:18:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:18:22,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:22,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:22,282 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1566110362, now seen corresponding path program 1 times [2019-11-24 04:18:22,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:22,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956773550] [2019-11-24 04:18:22,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:22,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956773550] [2019-11-24 04:18:22,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:22,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:22,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109438735] [2019-11-24 04:18:22,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:22,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:22,339 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-11-24 04:18:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,435 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2019-11-24 04:18:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:22,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 04:18:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,440 INFO L225 Difference]: With dead ends: 142 [2019-11-24 04:18:22,440 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 04:18:22,441 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:18:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 04:18:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 51. [2019-11-24 04:18:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-24 04:18:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-24 04:18:22,457 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 9 [2019-11-24 04:18:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:22,457 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-24 04:18:22,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-24 04:18:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:18:22,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:22,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:22,459 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1304785047, now seen corresponding path program 1 times [2019-11-24 04:18:22,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:22,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722890553] [2019-11-24 04:18:22,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722890553] [2019-11-24 04:18:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:22,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824223673] [2019-11-24 04:18:22,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:22,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:22,514 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2019-11-24 04:18:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,620 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-11-24 04:18:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:22,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-24 04:18:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,622 INFO L225 Difference]: With dead ends: 91 [2019-11-24 04:18:22,622 INFO L226 Difference]: Without dead ends: 89 [2019-11-24 04:18:22,623 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:18:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-24 04:18:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 49. [2019-11-24 04:18:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-24 04:18:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-24 04:18:22,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2019-11-24 04:18:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:22,631 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-24 04:18:22,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-24 04:18:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:18:22,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:22,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:22,632 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1710544404, now seen corresponding path program 1 times [2019-11-24 04:18:22,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:22,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135038377] [2019-11-24 04:18:22,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:22,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135038377] [2019-11-24 04:18:22,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:22,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:22,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138148892] [2019-11-24 04:18:22,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:22,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:22,719 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 4 states. [2019-11-24 04:18:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,803 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-11-24 04:18:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:22,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:18:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,805 INFO L225 Difference]: With dead ends: 68 [2019-11-24 04:18:22,805 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:18:22,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:18:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:18:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2019-11-24 04:18:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-24 04:18:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-24 04:18:22,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2019-11-24 04:18:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:22,812 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-24 04:18:22,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-24 04:18:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:18:22,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:22,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:22,813 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634881, now seen corresponding path program 1 times [2019-11-24 04:18:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328876791] [2019-11-24 04:18:22,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:22,884 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:18:22,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328876791] [2019-11-24 04:18:22,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150311614] [2019-11-24 04:18:22,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:22,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:22,888 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-11-24 04:18:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:22,993 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-11-24 04:18:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:22,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 04:18:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:22,994 INFO L225 Difference]: With dead ends: 86 [2019-11-24 04:18:22,995 INFO L226 Difference]: Without dead ends: 84 [2019-11-24 04:18:22,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-24 04:18:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 45. [2019-11-24 04:18:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 04:18:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-24 04:18:23,001 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2019-11-24 04:18:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,001 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-24 04:18:23,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-24 04:18:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:18:23,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:23,003 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1487264860, now seen corresponding path program 1 times [2019-11-24 04:18:23,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145389147] [2019-11-24 04:18:23,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,057 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:18:23,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145389147] [2019-11-24 04:18:23,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:23,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376036633] [2019-11-24 04:18:23,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:23,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:23,060 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-11-24 04:18:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:23,196 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-24 04:18:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:23,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-24 04:18:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:23,197 INFO L225 Difference]: With dead ends: 74 [2019-11-24 04:18:23,197 INFO L226 Difference]: Without dead ends: 72 [2019-11-24 04:18:23,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-24 04:18:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2019-11-24 04:18:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-24 04:18:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-24 04:18:23,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2019-11-24 04:18:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,204 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-24 04:18:23,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-24 04:18:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:18:23,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:23,207 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash -231889442, now seen corresponding path program 1 times [2019-11-24 04:18:23,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92730518] [2019-11-24 04:18:23,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:23,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92730518] [2019-11-24 04:18:23,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:23,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065461858] [2019-11-24 04:18:23,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:23,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:23,289 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-11-24 04:18:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:23,367 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-11-24 04:18:23,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:23,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-24 04:18:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:23,369 INFO L225 Difference]: With dead ends: 82 [2019-11-24 04:18:23,369 INFO L226 Difference]: Without dead ends: 80 [2019-11-24 04:18:23,369 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:18:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-24 04:18:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 41. [2019-11-24 04:18:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-24 04:18:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-24 04:18:23,377 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2019-11-24 04:18:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,377 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-24 04:18:23,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-24 04:18:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:18:23,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:23,384 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1139433715, now seen corresponding path program 1 times [2019-11-24 04:18:23,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963671490] [2019-11-24 04:18:23,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,461 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:18:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963671490] [2019-11-24 04:18:23,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:23,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995206825] [2019-11-24 04:18:23,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:23,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:23,464 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-24 04:18:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:23,541 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-24 04:18:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:23,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:18:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:23,542 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:18:23,542 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 04:18:23,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 04:18:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-24 04:18:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-24 04:18:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-24 04:18:23,547 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2019-11-24 04:18:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,548 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-24 04:18:23,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-24 04:18:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:18:23,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:23,549 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 962710923, now seen corresponding path program 1 times [2019-11-24 04:18:23,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209965126] [2019-11-24 04:18:23,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,634 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:18:23,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209965126] [2019-11-24 04:18:23,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:23,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098664848] [2019-11-24 04:18:23,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:23,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:23,637 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-24 04:18:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:23,698 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-24 04:18:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:23,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-24 04:18:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:23,700 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:18:23,700 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 04:18:23,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:18:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 04:18:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2019-11-24 04:18:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-24 04:18:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-24 04:18:23,706 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-11-24 04:18:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,706 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-24 04:18:23,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-24 04:18:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:18:23,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:23,707 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash -220728326, now seen corresponding path program 1 times [2019-11-24 04:18:23,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110913776] [2019-11-24 04:18:23,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,762 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:18:23,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110913776] [2019-11-24 04:18:23,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:23,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261374011] [2019-11-24 04:18:23,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:23,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:23,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:23,764 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-11-24 04:18:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:23,853 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-24 04:18:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:23,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:18:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:23,855 INFO L225 Difference]: With dead ends: 64 [2019-11-24 04:18:23,855 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 04:18:23,855 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:18:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 04:18:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2019-11-24 04:18:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 04:18:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-24 04:18:23,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2019-11-24 04:18:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:23,864 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-24 04:18:23,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-24 04:18:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:18:23,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:23,867 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:18:23,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1747360626, now seen corresponding path program 1 times [2019-11-24 04:18:23,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:23,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942433437] [2019-11-24 04:18:23,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:23,956 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:18:23,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942433437] [2019-11-24 04:18:23,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:23,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:23,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673590680] [2019-11-24 04:18:23,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:23,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:23,959 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-11-24 04:18:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:24,053 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-24 04:18:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:24,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:18:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:24,056 INFO L225 Difference]: With dead ends: 69 [2019-11-24 04:18:24,056 INFO L226 Difference]: Without dead ends: 67 [2019-11-24 04:18:24,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:18:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-24 04:18:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 33. [2019-11-24 04:18:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 04:18:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-24 04:18:24,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2019-11-24 04:18:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:24,069 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-24 04:18:24,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-24 04:18:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:18:24,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:24,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:24,071 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1666391295, now seen corresponding path program 1 times [2019-11-24 04:18:24,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044643275] [2019-11-24 04:18:24,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:24,193 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:18:24,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044643275] [2019-11-24 04:18:24,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:24,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:18:24,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916970147] [2019-11-24 04:18:24,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:18:24,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:18:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:24,196 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-11-24 04:18:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:24,338 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-11-24 04:18:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:18:24,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-24 04:18:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:24,340 INFO L225 Difference]: With dead ends: 57 [2019-11-24 04:18:24,340 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 04:18:24,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:18:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 04:18:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-11-24 04:18:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:18:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-24 04:18:24,346 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2019-11-24 04:18:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:24,346 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-24 04:18:24,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:18:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-24 04:18:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:18:24,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:24,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:24,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash -118518439, now seen corresponding path program 1 times [2019-11-24 04:18:24,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:24,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541329059] [2019-11-24 04:18:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:24,416 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:18:24,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541329059] [2019-11-24 04:18:24,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:24,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:24,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351180444] [2019-11-24 04:18:24,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:24,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:24,418 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-11-24 04:18:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:24,528 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2019-11-24 04:18:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:24,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:18:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:24,530 INFO L225 Difference]: With dead ends: 82 [2019-11-24 04:18:24,530 INFO L226 Difference]: Without dead ends: 80 [2019-11-24 04:18:24,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:18:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-24 04:18:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 29. [2019-11-24 04:18:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-24 04:18:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-24 04:18:24,537 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2019-11-24 04:18:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-24 04:18:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-24 04:18:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:18:24,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:24,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:24,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 620899848, now seen corresponding path program 1 times [2019-11-24 04:18:24,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:24,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272875041] [2019-11-24 04:18:24,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:24,623 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:18:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272875041] [2019-11-24 04:18:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:24,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957715522] [2019-11-24 04:18:24,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:24,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:24,625 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-11-24 04:18:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:24,751 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2019-11-24 04:18:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:18:24,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-24 04:18:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:24,752 INFO L225 Difference]: With dead ends: 55 [2019-11-24 04:18:24,753 INFO L226 Difference]: Without dead ends: 53 [2019-11-24 04:18:24,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:18:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-24 04:18:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-11-24 04:18:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-24 04:18:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-24 04:18:24,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2019-11-24 04:18:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:24,760 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-24 04:18:24,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-24 04:18:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:18:24,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:24,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:24,761 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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:18:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2068030272, now seen corresponding path program 1 times [2019-11-24 04:18:24,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:24,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634052270] [2019-11-24 04:18:24,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:24,814 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:18:24,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634052270] [2019-11-24 04:18:24,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:24,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:24,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888873197] [2019-11-24 04:18:24,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:24,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:24,816 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2019-11-24 04:18:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:24,983 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-11-24 04:18:24,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:18:24,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-24 04:18:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:24,984 INFO L225 Difference]: With dead ends: 120 [2019-11-24 04:18:24,984 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:18:24,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:18:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:18:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:18:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:18:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:18:24,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-24 04:18:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:24,986 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:18:24,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:18:24,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:18:24,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:18:25,126 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 81 [2019-11-24 04:18:25,297 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 58 [2019-11-24 04:18:25,462 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 89 [2019-11-24 04:18:25,665 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-11-24 04:18:25,794 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 9 [2019-11-24 04:18:26,076 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 34 [2019-11-24 04:18:26,079 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-11-24 04:18:26,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-24 04:18:26,079 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-11-24 04:18:26,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:18:26,080 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-11-24 04:18:26,080 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-11-24 04:18:26,080 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-11-24 04:18:26,082 INFO L440 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and (< ULTIMATE.start_main_~main__j~0 ULTIMATE.start_main_~main__bufsize~0) .cse3) (and .cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~12)))))) (.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) (.cse2 (<= 1 ULTIMATE.start_main_~main__j~0))) (or (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) .cse0 (<= 0 ULTIMATE.start_main_~main__j~0)) (and .cse1 .cse0 .cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0)) (and .cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse0 .cse2))) [2019-11-24 04:18:26,082 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-24 04:18:26,082 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-11-24 04:18:26,082 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:18:26,082 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-11-24 04:18:26,082 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-11-24 04:18:26,083 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-24 04:18:26,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-11-24 04:18:26,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-11-24 04:18:26,086 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-24 04:18:26,087 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-11-24 04:18:26,087 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-11-24 04:18:26,088 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-11-24 04:18:26,088 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-24 04:18:26,088 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-11-24 04:18:26,088 INFO L440 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-11-24 04:18:26,088 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-11-24 04:18:26,089 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-24 04:18:26,089 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-24 04:18:26,089 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-24 04:18:26,089 INFO L447 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-11-24 04:18:26,089 INFO L444 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-24 04:18:26,089 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-24 04:18:26,090 INFO L444 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-24 04:18:26,091 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-11-24 04:18:26,091 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-11-24 04:18:26,091 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-24 04:18:26,091 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-11-24 04:18:26,091 INFO L440 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-11-24 04:18:26,092 INFO L444 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-24 04:18:26,092 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-11-24 04:18:26,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:18:26 BoogieIcfgContainer [2019-11-24 04:18:26,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:18:26,130 INFO L168 Benchmark]: Toolchain (without parser) took 5330.78 ms. Allocated memory was 137.9 MB in the beginning and 284.2 MB in the end (delta: 146.3 MB). Free memory was 102.4 MB in the beginning and 193.1 MB in the end (delta: -90.8 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,136 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.08 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 179.9 MB in the end (delta: -77.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.63 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 177.9 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:18:26,141 INFO L168 Benchmark]: Boogie Preprocessor took 46.88 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 176.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,144 INFO L168 Benchmark]: RCFGBuilder took 457.82 ms. Allocated memory is still 201.9 MB. Free memory was 176.5 MB in the beginning and 153.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,145 INFO L168 Benchmark]: TraceAbstraction took 4375.48 ms. Allocated memory was 201.9 MB in the beginning and 284.2 MB in the end (delta: 82.3 MB). Free memory was 153.5 MB in the beginning and 193.1 MB in the end (delta: -39.6 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:26,152 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 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.08 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 179.9 MB in the end (delta: -77.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.63 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 177.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.88 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 176.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 457.82 ms. Allocated memory is still 201.9 MB. Free memory was 176.5 MB in the beginning and 153.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4375.48 ms. Allocated memory was 201.9 MB in the beginning and 284.2 MB in the end (delta: 82.3 MB). Free memory was 153.5 MB in the beginning and 193.1 MB in the end (delta: -39.6 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__limit + 4 <= main__bufsize) && main__i + 1 <= main__len) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j) || (((((main__j < main__bufsize && 1 <= main__i) || (1 <= main__i && !(0 == __VERIFIER_assert__cond))) && main__limit + 4 <= main__bufsize) && 1 <= main__j) && main__j + 4 <= main__bufsize)) || (((((main__j < main__bufsize && 1 <= main__i) || (1 <= main__i && !(0 == __VERIFIER_assert__cond))) && !(0 == __VERIFIER_assert__cond)) && main__limit + 4 <= main__bufsize) && 1 <= main__j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 16 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 843 SDtfs, 1296 SDslu, 596 SDs, 0 SdLazy, 801 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 109 HoareAnnotationTreeSize, 4 FomulaSimplifications, 247400221 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 159330 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 8869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...