/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:34:12,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:34:12,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:34:12,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:34:12,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:34:12,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:34:12,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:34:12,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:34:12,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:34:12,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:34:12,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:34:12,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:34:12,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:34:12,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:34:12,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:34:12,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:34:12,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:34:12,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:34:12,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:34:12,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:34:12,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:34:12,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:34:12,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:34:12,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:34:12,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:34:12,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:34:12,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:34:12,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:34:12,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:34:12,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:34:12,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:34:12,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:34:12,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:34:12,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:34:12,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:34:12,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:34:12,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:34:12,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:34:12,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:34:12,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:34:12,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:34:12,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:34:12,952 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:34:12,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:34:12,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:34:12,954 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:34:12,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:34:12,956 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:34:12,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:34:12,956 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:34:12,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:34:12,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:34:12,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:34:12,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:34:12,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:34:12,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:34:12,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:34:12,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:34:12,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:34:12,958 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:34:12,958 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 11:34:13,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:34:13,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:34:13,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:34:13,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:34:13,294 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:34:13,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2021-05-06 11:34:13,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49269d4e/e5021becaf134d58a7405019cd5da01d/FLAGabbae824a [2021-05-06 11:34:13,797 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:34:13,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2021-05-06 11:34:13,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49269d4e/e5021becaf134d58a7405019cd5da01d/FLAGabbae824a [2021-05-06 11:34:13,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49269d4e/e5021becaf134d58a7405019cd5da01d [2021-05-06 11:34:13,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:34:13,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:34:13,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:34:13,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:34:13,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:34:13,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:34:13" (1/1) ... [2021-05-06 11:34:13,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b32df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:13, skipping insertion in model container [2021-05-06 11:34:13,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:34:13" (1/1) ... [2021-05-06 11:34:13,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:34:13,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:34:14,001 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2021-05-06 11:34:14,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:34:14,081 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:34:14,094 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2021-05-06 11:34:14,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:34:14,124 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:34:14,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14 WrapperNode [2021-05-06 11:34:14,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:34:14,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:34:14,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:34:14,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:34:14,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (1/1) ... [2021-05-06 11:34:14,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:34:14,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:34:14,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:34:14,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:34:14,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (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 [2021-05-06 11:34:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:34:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:34:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:34:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:34:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:34:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:34:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:34:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:34:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-06 11:34:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-06 11:34:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:34:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:34:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:34:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:34:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:34:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:34:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:34:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:34:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:34:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:34:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:34:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:34:14,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:34:14,609 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 11:34:14,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:34:14 BoogieIcfgContainer [2021-05-06 11:34:14,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:34:14,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:34:14,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:34:14,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:34:14,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:34:13" (1/3) ... [2021-05-06 11:34:14,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1e4b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:34:14, skipping insertion in model container [2021-05-06 11:34:14,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:34:14" (2/3) ... [2021-05-06 11:34:14,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1e4b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:34:14, skipping insertion in model container [2021-05-06 11:34:14,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:34:14" (3/3) ... [2021-05-06 11:34:14,633 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2021-05-06 11:34:14,638 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:34:14,640 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:34:14,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:34:14,678 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:34:14,678 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:34:14,678 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:34:14,678 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:34:14,679 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:34:14,679 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:34:14,679 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:34:14,679 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:34:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-06 11:34:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 11:34:14,703 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:14,703 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:14,704 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2021-05-06 11:34:14,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:14,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726275785] [2021-05-06 11:34:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:14,773 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:15,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:34:15,036 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:15,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726275785] [2021-05-06 11:34:15,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [726275785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:15,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:15,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:15,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78065589] [2021-05-06 11:34:15,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:15,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:15,067 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:34:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:15,663 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2021-05-06 11:34:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-06 11:34:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:15,673 INFO L225 Difference]: With dead ends: 112 [2021-05-06 11:34:15,673 INFO L226 Difference]: Without dead ends: 64 [2021-05-06 11:34:15,678 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 183.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-06 11:34:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2021-05-06 11:34:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 11:34:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-05-06 11:34:15,742 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2021-05-06 11:34:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:15,743 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-05-06 11:34:15,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:34:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-05-06 11:34:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:34:15,744 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:15,745 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:15,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:34:15,745 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:15,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2021-05-06 11:34:15,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:15,746 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454104836] [2021-05-06 11:34:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:15,759 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:15,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:15,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:34:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:34:15,871 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:15,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454104836] [2021-05-06 11:34:15,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1454104836] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:15,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:15,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:34:15,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156628908] [2021-05-06 11:34:15,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:34:15,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:34:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:34:15,873 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:34:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:16,233 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2021-05-06 11:34:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:16,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-05-06 11:34:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:16,236 INFO L225 Difference]: With dead ends: 63 [2021-05-06 11:34:16,236 INFO L226 Difference]: Without dead ends: 61 [2021-05-06 11:34:16,237 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 143.9ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:34:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-06 11:34:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-06 11:34:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 11:34:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2021-05-06 11:34:16,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2021-05-06 11:34:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:16,253 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2021-05-06 11:34:16,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:34:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2021-05-06 11:34:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-06 11:34:16,255 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:16,255 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:16,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:34:16,255 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:16,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2021-05-06 11:34:16,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:16,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1500193390] [2021-05-06 11:34:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:16,258 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:34:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:34:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 11:34:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 11:34:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-06 11:34:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 11:34:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 11:34:16,342 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:16,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1500193390] [2021-05-06 11:34:16,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1500193390] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:16,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:16,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:34:16,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227356386] [2021-05-06 11:34:16,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:34:16,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:34:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:34:16,344 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-06 11:34:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:16,552 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2021-05-06 11:34:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:34:16,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2021-05-06 11:34:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:16,554 INFO L225 Difference]: With dead ends: 90 [2021-05-06 11:34:16,554 INFO L226 Difference]: Without dead ends: 61 [2021-05-06 11:34:16,555 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:34:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-06 11:34:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-06 11:34:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 11:34:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2021-05-06 11:34:16,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2021-05-06 11:34:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:16,568 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2021-05-06 11:34:16,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-06 11:34:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2021-05-06 11:34:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-06 11:34:16,570 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:16,570 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:16,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:34:16,570 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2021-05-06 11:34:16,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:16,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [428786690] [2021-05-06 11:34:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:16,572 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:34:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:34:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 11:34:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 11:34:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:34:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-06 11:34:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 11:34:16,668 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:16,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [428786690] [2021-05-06 11:34:16,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [428786690] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:16,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:16,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:34:16,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609495968] [2021-05-06 11:34:16,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:34:16,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:34:16,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:34:16,670 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-06 11:34:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:17,017 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2021-05-06 11:34:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2021-05-06 11:34:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:17,019 INFO L225 Difference]: With dead ends: 68 [2021-05-06 11:34:17,019 INFO L226 Difference]: Without dead ends: 66 [2021-05-06 11:34:17,020 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 113.1ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:34:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-06 11:34:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-05-06 11:34:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 11:34:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2021-05-06 11:34:17,033 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2021-05-06 11:34:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:17,033 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2021-05-06 11:34:17,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-06 11:34:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2021-05-06 11:34:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-06 11:34:17,035 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:17,035 INFO L523 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:17,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:34:17,036 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2021-05-06 11:34:17,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:17,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [986906505] [2021-05-06 11:34:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:17,038 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:34:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:34:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 11:34:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 11:34:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:34:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-06 11:34:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 11:34:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 11:34:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 11:34:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-06 11:34:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-06 11:34:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-06 11:34:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-06 11:34:17,194 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:17,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [986906505] [2021-05-06 11:34:17,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [986906505] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:17,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:17,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:34:17,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60040666] [2021-05-06 11:34:17,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:34:17,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:34:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:34:17,196 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-05-06 11:34:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:17,523 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2021-05-06 11:34:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2021-05-06 11:34:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:17,526 INFO L225 Difference]: With dead ends: 74 [2021-05-06 11:34:17,526 INFO L226 Difference]: Without dead ends: 72 [2021-05-06 11:34:17,527 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 130.5ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:34:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-06 11:34:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-05-06 11:34:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-06 11:34:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2021-05-06 11:34:17,540 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2021-05-06 11:34:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:17,540 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2021-05-06 11:34:17,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-05-06 11:34:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2021-05-06 11:34:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-06 11:34:17,542 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:17,542 INFO L523 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:17,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:34:17,543 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2021-05-06 11:34:17,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:17,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384692391] [2021-05-06 11:34:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:17,545 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-06 11:34:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:34:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 11:34:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 11:34:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:34:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-06 11:34:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 11:34:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 11:34:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 11:34:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-06 11:34:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-06 11:34:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-06 11:34:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-05-06 11:34:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-06 11:34:17,646 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:17,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384692391] [2021-05-06 11:34:17,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1384692391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:17,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:17,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:34:17,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105532458] [2021-05-06 11:34:17,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:34:17,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:34:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:34:17,648 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-05-06 11:34:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:17,986 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2021-05-06 11:34:17,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2021-05-06 11:34:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:17,988 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:34:17,988 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:34:17,988 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 124.2ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:34:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:34:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:34:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-06 11:34:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:34:17,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2021-05-06 11:34:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:17,989 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:34:17,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-05-06 11:34:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:34:17,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:34:17,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:34:17,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:34:19,496 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-06 11:34:19,497 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-06 11:34:19,497 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-06 11:34:19,497 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,497 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-06 11:34:19,497 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,497 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,497 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,498 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,498 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:34:19,498 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-06 11:34:19,498 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:34:19,498 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:34:19,498 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:34:19,498 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2021-05-06 11:34:19,498 INFO L194 CegarLoopUtils]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,498 INFO L194 CegarLoopUtils]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-06 11:34:19,498 INFO L201 CegarLoopUtils]: At program point L36(lines 25 83) the Hoare annotation is: true [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L69-1(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L61(lines 61 79) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2021-05-06 11:34:19,499 INFO L194 CegarLoopUtils]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L71(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L71-1(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L63-1(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,500 INFO L194 CegarLoopUtils]: At program point L72(line 72) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L201 CegarLoopUtils]: At program point L81(lines 25 83) the Hoare annotation is: true [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L201 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: true [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2) (and (= main_~c~0 0) .cse0 .cse1 .cse2))) [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,501 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,502 INFO L201 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-06 11:34:19,502 INFO L201 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: true [2021-05-06 11:34:19,502 INFO L194 CegarLoopUtils]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-06 11:34:19,503 INFO L201 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: true [2021-05-06 11:34:19,503 INFO L201 CegarLoopUtils]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:34:19,503 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:34:19,503 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:34:19,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:34:19 BoogieIcfgContainer [2021-05-06 11:34:19,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:34:19,518 INFO L168 Benchmark]: Toolchain (without parser) took 5691.39 ms. Allocated memory was 189.8 MB in the beginning and 239.1 MB in the end (delta: 49.3 MB). Free memory was 167.9 MB in the beginning and 109.1 MB in the end (delta: 58.8 MB). Peak memory consumption was 136.5 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:19,518 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 127.9 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:34:19,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.31 ms. Allocated memory is still 189.8 MB. Free memory was 167.6 MB in the beginning and 170.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:19,519 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 189.8 MB. Free memory was 170.7 MB in the beginning and 169.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:19,519 INFO L168 Benchmark]: RCFGBuilder took 439.77 ms. Allocated memory is still 189.8 MB. Free memory was 168.8 MB in the beginning and 148.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:19,520 INFO L168 Benchmark]: TraceAbstraction took 4904.85 ms. Allocated memory was 189.8 MB in the beginning and 239.1 MB in the end (delta: 49.3 MB). Free memory was 148.7 MB in the beginning and 109.1 MB in the end (delta: 39.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:19,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 127.9 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 294.31 ms. Allocated memory is still 189.8 MB. Free memory was 167.6 MB in the beginning and 170.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 189.8 MB. Free memory was 170.7 MB in the beginning and 169.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 439.77 ms. Allocated memory is still 189.8 MB. Free memory was 168.8 MB in the beginning and 148.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4904.85 ms. Allocated memory was 189.8 MB in the beginning and 239.1 MB in the end (delta: 49.3 MB). Free memory was 148.7 MB in the beginning and 109.1 MB in the end (delta: 39.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3314.3ms, OverallIterations: 6, TraceHistogramMax: 14, EmptinessCheckTime: 17.4ms, AutomataDifference: 2232.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1505.6ms, InitialAbstractionConstructionTime: 13.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 294 SDtfs, 275 SDslu, 356 SDs, 0 SdLazy, 1069 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1129.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 735.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 106.7ms AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 54 LocationsWithAnnotation, 354 PreInvPairs, 452 NumberOfFragments, 783 HoareAnnotationTreeSize, 354 FomulaSimplifications, 1484 FormulaSimplificationTreeSizeReduction, 310.4ms HoareSimplificationTime, 54 FomulaSimplificationsInter, 1486 FormulaSimplificationTreeSizeReductionInter, 1164.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && 1 <= cp) && cp < urilen - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((1 <= c && 0 < scheme + 1) && 1 <= cp) && cp < urilen) || (((c == 0 && 0 < scheme + 1) && 1 <= cp) && cp < urilen) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...