/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/eca-rers2012/Problem01_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:33,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:33,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:33,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:33,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:33,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:33,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:33,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:33,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:33,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:33,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:33,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:33,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:33,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:33,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:33,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:33,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:33,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:33,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:33,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:33,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:33,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:33,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:33,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:33,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:33,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:33,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:33,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:33,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:33,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:33,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:33,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:33,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:33,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:33,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:33,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:33,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:33,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:33,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:33,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:33,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:33,831 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-23 23:31:33,856 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:33,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:33,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:33,859 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:33,859 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:33,859 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:33,859 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:33,860 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:33,860 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:33,860 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:33,860 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:33,860 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:33,861 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:33,862 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:33,862 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:33,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:33,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:33,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:33,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:33,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:33,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:33,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:33,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:33,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:33,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:33,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:33,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:33,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:33,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:33,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:33,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:33,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:33,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:33,871 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:33,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:33,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:33,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:33,873 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:34,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:34,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:34,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:34,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:34,176 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:34,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-11-23 23:31:34,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985224093/86ddfc48cdf14dc6b43fc92c4a7ebe2b/FLAG39a34f34a [2019-11-23 23:31:34,863 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:34,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-11-23 23:31:34,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985224093/86ddfc48cdf14dc6b43fc92c4a7ebe2b/FLAG39a34f34a [2019-11-23 23:31:35,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985224093/86ddfc48cdf14dc6b43fc92c4a7ebe2b [2019-11-23 23:31:35,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:35,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:35,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:35,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:35,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:35,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67690949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35, skipping insertion in model container [2019-11-23 23:31:35,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:35,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:35,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:35,704 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:35,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:35,837 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:35,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35 WrapperNode [2019-11-23 23:31:35,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:35,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:35,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:35,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:35,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:35,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:35,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:35,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:35,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:35,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (1/1) ... [2019-11-23 23:31:36,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:36,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:36,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:36,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:36,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (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-23 23:31:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:36,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:38,159 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:38,159 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:38,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:38 BoogieIcfgContainer [2019-11-23 23:31:38,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:38,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:38,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:38,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:38,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:35" (1/3) ... [2019-11-23 23:31:38,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0a864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:38, skipping insertion in model container [2019-11-23 23:31:38,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:35" (2/3) ... [2019-11-23 23:31:38,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0a864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:38, skipping insertion in model container [2019-11-23 23:31:38,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:38" (3/3) ... [2019-11-23 23:31:38,169 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2019-11-23 23:31:38,179 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:38,186 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:38,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:38,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:38,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:38,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:38,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:38,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:38,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:38,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:38,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:38,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:38,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:38,253 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1323240991, now seen corresponding path program 1 times [2019-11-23 23:31:38,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:38,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943391713] [2019-11-23 23:31:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:38,617 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-23 23:31:38,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943391713] [2019-11-23 23:31:38,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:38,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:38,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878409427] [2019-11-23 23:31:38,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:38,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:38,645 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:31:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:39,206 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:31:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:39,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:31:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:39,228 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:31:39,228 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:31:39,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:31:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:31:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:31:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:39,309 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:39,310 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:39,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:31:39,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:39,314 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:39,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 585776729, now seen corresponding path program 1 times [2019-11-23 23:31:39,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:39,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921054077] [2019-11-23 23:31:39,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:39,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921054077] [2019-11-23 23:31:39,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:39,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:39,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936993663] [2019-11-23 23:31:39,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:39,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:39,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:39,369 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:39,827 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:31:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:39,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:31:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:39,831 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:31:39,833 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:31:39,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:31:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:31:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 479 transitions. [2019-11-23 23:31:39,868 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 479 transitions. Word has length 76 [2019-11-23 23:31:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:39,869 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 479 transitions. [2019-11-23 23:31:39,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 479 transitions. [2019-11-23 23:31:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:39,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:39,878 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:39,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1566186171, now seen corresponding path program 1 times [2019-11-23 23:31:39,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:39,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955760392] [2019-11-23 23:31:39,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:39,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955760392] [2019-11-23 23:31:39,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:39,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:39,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368772018] [2019-11-23 23:31:39,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:39,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:39,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:39,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:39,974 INFO L87 Difference]: Start difference. First operand 287 states and 479 transitions. Second operand 3 states. [2019-11-23 23:31:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:40,299 INFO L93 Difference]: Finished difference Result 644 states and 1076 transitions. [2019-11-23 23:31:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:40,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:31:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:40,302 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:40,302 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 23:31:40,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:31:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 23:31:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2019-11-23 23:31:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 473 transitions. [2019-11-23 23:31:40,337 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 473 transitions. Word has length 84 [2019-11-23 23:31:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:40,338 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 473 transitions. [2019-11-23 23:31:40,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 473 transitions. [2019-11-23 23:31:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:40,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:40,340 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:40,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash -81018857, now seen corresponding path program 1 times [2019-11-23 23:31:40,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:40,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861564077] [2019-11-23 23:31:40,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:40,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861564077] [2019-11-23 23:31:40,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:40,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:40,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536646801] [2019-11-23 23:31:40,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:40,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:40,411 INFO L87 Difference]: Start difference. First operand 287 states and 473 transitions. Second operand 4 states. [2019-11-23 23:31:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:41,048 INFO L93 Difference]: Finished difference Result 1070 states and 1768 transitions. [2019-11-23 23:31:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:41,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:31:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:41,053 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:31:41,053 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:41,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:31:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:31:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1105 transitions. [2019-11-23 23:31:41,074 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1105 transitions. Word has length 93 [2019-11-23 23:31:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:41,075 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1105 transitions. [2019-11-23 23:31:41,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1105 transitions. [2019-11-23 23:31:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:41,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:41,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:41,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2009833606, now seen corresponding path program 1 times [2019-11-23 23:31:41,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:41,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392943252] [2019-11-23 23:31:41,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:41,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392943252] [2019-11-23 23:31:41,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:41,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:41,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632517895] [2019-11-23 23:31:41,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:41,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:41,241 INFO L87 Difference]: Start difference. First operand 713 states and 1105 transitions. Second operand 4 states. [2019-11-23 23:31:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:41,816 INFO L93 Difference]: Finished difference Result 1513 states and 2315 transitions. [2019-11-23 23:31:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:41,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:31:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:41,821 INFO L225 Difference]: With dead ends: 1513 [2019-11-23 23:31:41,822 INFO L226 Difference]: Without dead ends: 801 [2019-11-23 23:31:41,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-23 23:31:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 784. [2019-11-23 23:31:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1182 transitions. [2019-11-23 23:31:41,846 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1182 transitions. Word has length 99 [2019-11-23 23:31:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:41,847 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1182 transitions. [2019-11-23 23:31:41,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1182 transitions. [2019-11-23 23:31:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:31:41,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:41,849 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:41,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1788093118, now seen corresponding path program 1 times [2019-11-23 23:31:41,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:41,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128083986] [2019-11-23 23:31:41,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:41,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128083986] [2019-11-23 23:31:41,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:41,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038045404] [2019-11-23 23:31:41,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:41,925 INFO L87 Difference]: Start difference. First operand 784 states and 1182 transitions. Second operand 4 states. [2019-11-23 23:31:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:42,520 INFO L93 Difference]: Finished difference Result 1567 states and 2375 transitions. [2019-11-23 23:31:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:42,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:31:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:42,525 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:31:42,525 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:42,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:31:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1253 transitions. [2019-11-23 23:31:42,552 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1253 transitions. Word has length 103 [2019-11-23 23:31:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:42,552 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1253 transitions. [2019-11-23 23:31:42,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1253 transitions. [2019-11-23 23:31:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:31:42,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:42,557 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:42,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1752317497, now seen corresponding path program 1 times [2019-11-23 23:31:42,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:42,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696913048] [2019-11-23 23:31:42,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696913048] [2019-11-23 23:31:42,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:42,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096550857] [2019-11-23 23:31:42,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:42,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:42,683 INFO L87 Difference]: Start difference. First operand 855 states and 1253 transitions. Second operand 3 states. [2019-11-23 23:31:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:43,080 INFO L93 Difference]: Finished difference Result 1993 states and 2965 transitions. [2019-11-23 23:31:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:43,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:31:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:43,085 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:43,085 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:43,087 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-23 23:31:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:31:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1147 transitions. [2019-11-23 23:31:43,111 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1147 transitions. Word has length 106 [2019-11-23 23:31:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:43,111 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1147 transitions. [2019-11-23 23:31:43,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1147 transitions. [2019-11-23 23:31:43,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:43,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:43,115 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:43,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1472791011, now seen corresponding path program 1 times [2019-11-23 23:31:43,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:43,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528738229] [2019-11-23 23:31:43,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:43,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528738229] [2019-11-23 23:31:43,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:43,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:43,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727879834] [2019-11-23 23:31:43,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:43,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:43,206 INFO L87 Difference]: Start difference. First operand 926 states and 1147 transitions. Second operand 5 states. [2019-11-23 23:31:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:43,890 INFO L93 Difference]: Finished difference Result 2492 states and 3154 transitions. [2019-11-23 23:31:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:43,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:31:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:43,899 INFO L225 Difference]: With dead ends: 2492 [2019-11-23 23:31:43,899 INFO L226 Difference]: Without dead ends: 1638 [2019-11-23 23:31:43,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-11-23 23:31:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1352. [2019-11-23 23:31:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1625 transitions. [2019-11-23 23:31:43,971 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1625 transitions. Word has length 121 [2019-11-23 23:31:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:43,971 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1625 transitions. [2019-11-23 23:31:43,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1625 transitions. [2019-11-23 23:31:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:31:43,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:43,978 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:43,978 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1169259441, now seen corresponding path program 1 times [2019-11-23 23:31:43,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:43,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132423284] [2019-11-23 23:31:43,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:31:44,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132423284] [2019-11-23 23:31:44,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:44,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:44,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971581692] [2019-11-23 23:31:44,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:44,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:44,133 INFO L87 Difference]: Start difference. First operand 1352 states and 1625 transitions. Second operand 4 states. [2019-11-23 23:31:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:44,659 INFO L93 Difference]: Finished difference Result 2916 states and 3544 transitions. [2019-11-23 23:31:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:44,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:31:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:44,668 INFO L225 Difference]: With dead ends: 2916 [2019-11-23 23:31:44,668 INFO L226 Difference]: Without dead ends: 1565 [2019-11-23 23:31:44,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-23 23:31:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1352. [2019-11-23 23:31:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1546 transitions. [2019-11-23 23:31:44,705 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1546 transitions. Word has length 150 [2019-11-23 23:31:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:44,705 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1546 transitions. [2019-11-23 23:31:44,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1546 transitions. [2019-11-23 23:31:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 23:31:44,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:44,711 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:44,711 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash -986753600, now seen corresponding path program 1 times [2019-11-23 23:31:44,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:44,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115423763] [2019-11-23 23:31:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-23 23:31:44,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115423763] [2019-11-23 23:31:44,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:44,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:44,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385313864] [2019-11-23 23:31:44,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:44,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:44,916 INFO L87 Difference]: Start difference. First operand 1352 states and 1546 transitions. Second operand 6 states. [2019-11-23 23:31:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:45,413 INFO L93 Difference]: Finished difference Result 2750 states and 3142 transitions. [2019-11-23 23:31:45,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:45,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-11-23 23:31:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:45,422 INFO L225 Difference]: With dead ends: 2750 [2019-11-23 23:31:45,422 INFO L226 Difference]: Without dead ends: 1470 [2019-11-23 23:31:45,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-11-23 23:31:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1281. [2019-11-23 23:31:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-23 23:31:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1452 transitions. [2019-11-23 23:31:45,455 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1452 transitions. Word has length 241 [2019-11-23 23:31:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:45,455 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1452 transitions. [2019-11-23 23:31:45,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1452 transitions. [2019-11-23 23:31:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-23 23:31:45,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:45,460 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:45,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash -352605103, now seen corresponding path program 1 times [2019-11-23 23:31:45,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:45,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665648952] [2019-11-23 23:31:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:31:45,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665648952] [2019-11-23 23:31:45,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:45,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:45,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227286153] [2019-11-23 23:31:45,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:45,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:45,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:45,584 INFO L87 Difference]: Start difference. First operand 1281 states and 1452 transitions. Second operand 3 states. [2019-11-23 23:31:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:45,924 INFO L93 Difference]: Finished difference Result 2630 states and 2997 transitions. [2019-11-23 23:31:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:45,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-23 23:31:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:45,926 INFO L225 Difference]: With dead ends: 2630 [2019-11-23 23:31:45,926 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:45,930 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-23 23:31:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:45,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2019-11-23 23:31:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:45,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:45,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:46,069 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-11-23 23:31:46,321 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-11-23 23:31:46,470 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-11-23 23:31:46,473 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:46,473 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:46,473 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:46,474 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:46,475 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:46,475 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:46,475 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:46,475 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:46,476 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:46,476 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:46,477 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 23:31:46,477 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:46,477 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:46,478 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:46,479 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:46,480 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:46,483 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:46,483 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:46,483 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 23:31:46,483 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:46,483 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:46,484 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:46,484 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:46,484 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:46,484 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:46,484 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:46,485 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:46,485 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:46,485 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:46,485 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:46,487 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:46,487 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:46,487 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:46,487 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 23:31:46,488 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:46,489 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:46,490 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:46,492 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:46,493 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:46,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:46 BoogieIcfgContainer [2019-11-23 23:31:46,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:46,537 INFO L168 Benchmark]: Toolchain (without parser) took 11443.65 ms. Allocated memory was 137.9 MB in the beginning and 391.1 MB in the end (delta: 253.2 MB). Free memory was 99.4 MB in the beginning and 231.8 MB in the end (delta: -132.5 MB). Peak memory consumption was 120.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,538 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.87 ms. Allocated memory was 137.9 MB in the beginning and 205.5 MB in the end (delta: 67.6 MB). Free memory was 99.2 MB in the beginning and 171.0 MB in the end (delta: -71.9 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.17 ms. Allocated memory is still 205.5 MB. Free memory was 171.0 MB in the beginning and 165.4 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,547 INFO L168 Benchmark]: Boogie Preprocessor took 69.71 ms. Allocated memory is still 205.5 MB. Free memory was 165.4 MB in the beginning and 160.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,548 INFO L168 Benchmark]: RCFGBuilder took 2148.92 ms. Allocated memory was 205.5 MB in the beginning and 251.7 MB in the end (delta: 46.1 MB). Free memory was 160.5 MB in the beginning and 208.6 MB in the end (delta: -48.1 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,549 INFO L168 Benchmark]: TraceAbstraction took 8372.43 ms. Allocated memory was 251.7 MB in the beginning and 391.1 MB in the end (delta: 139.5 MB). Free memory was 208.6 MB in the beginning and 231.8 MB in the end (delta: -23.3 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:46,559 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.34 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.87 ms. Allocated memory was 137.9 MB in the beginning and 205.5 MB in the end (delta: 67.6 MB). Free memory was 99.2 MB in the beginning and 171.0 MB in the end (delta: -71.9 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.17 ms. Allocated memory is still 205.5 MB. Free memory was 171.0 MB in the beginning and 165.4 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.71 ms. Allocated memory is still 205.5 MB. Free memory was 165.4 MB in the beginning and 160.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2148.92 ms. Allocated memory was 205.5 MB in the beginning and 251.7 MB in the end (delta: 46.1 MB). Free memory was 160.5 MB in the beginning and 208.6 MB in the end (delta: -48.1 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8372.43 ms. Allocated memory was 251.7 MB in the beginning and 391.1 MB in the end (delta: 139.5 MB). Free memory was 208.6 MB in the beginning and 231.8 MB in the end (delta: -23.3 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 734 SDtfs, 1088 SDslu, 86 SDs, 0 SdLazy, 3504 SolverSat, 746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 989 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 141 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6231 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 435371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 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...