/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-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:30:47,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:30:47,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:30:47,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:30:47,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:30:47,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:30:47,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:30:47,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:30:47,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:30:47,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:30:47,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:30:47,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:30:47,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:30:47,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:30:47,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:30:47,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:30:47,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:30:47,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:30:47,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:30:47,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:30:47,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:30:47,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:30:47,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:30:47,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:30:47,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:30:47,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:30:47,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:30:47,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:30:47,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:30:47,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:30:47,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:30:47,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:30:47,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:30:47,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:30:47,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:30:47,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:30:47,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:30:47,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:30:47,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:30:47,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:30:47,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:30:47,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:30:47,964 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:30:47,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:30:47,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:30:47,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:30:47,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:30:47,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:30:47,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:30:47,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:30:47,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:30:47,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:30:47,969 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:30:47,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:30:47,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:30:47,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:30:47,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:30:47,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:30:47,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:30:47,970 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:30:47,971 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-02 23:30:48,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:30:48,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:30:48,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:30:48,306 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:30:48,307 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:30:48,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2021-05-02 23:30:48,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9193fc4/7f24f0fa2531458da351b1c0e345a5b8/FLAG2849dfa9f [2021-05-02 23:30:48,836 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:30:48,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2021-05-02 23:30:48,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9193fc4/7f24f0fa2531458da351b1c0e345a5b8/FLAG2849dfa9f [2021-05-02 23:30:48,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9193fc4/7f24f0fa2531458da351b1c0e345a5b8 [2021-05-02 23:30:48,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:30:48,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:30:48,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:48,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:30:48,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:30:48,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:48" (1/1) ... [2021-05-02 23:30:48,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2af6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:48, skipping insertion in model container [2021-05-02 23:30:48,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:48" (1/1) ... [2021-05-02 23:30:48,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:30:48,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:30:49,026 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-get-tag.i[893,906] [2021-05-02 23:30:49,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:49,047 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:30:49,058 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-get-tag.i[893,906] [2021-05-02 23:30:49,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:49,110 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:30:49,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49 WrapperNode [2021-05-02 23:30:49,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:49,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:30:49,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:30:49,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:30:49,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (1/1) ... [2021-05-02 23:30:49,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:30:49,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:30:49,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:30:49,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:30:49,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (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-02 23:30:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:30:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:30:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:30:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:30:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:30:49,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:30:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:30:49,244 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:30:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:30:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:30:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:30:49,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:30:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:30:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:30:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:30:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:30:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:30:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:30:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:30:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:30:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:30:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:30:49,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:30:49,575 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 23:30:49,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:49 BoogieIcfgContainer [2021-05-02 23:30:49,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:30:49,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:30:49,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:30:49,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:30:49,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:30:48" (1/3) ... [2021-05-02 23:30:49,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39769db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:49, skipping insertion in model container [2021-05-02 23:30:49,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:49" (2/3) ... [2021-05-02 23:30:49,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39769db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:49, skipping insertion in model container [2021-05-02 23:30:49,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:49" (3/3) ... [2021-05-02 23:30:49,583 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2021-05-02 23:30:49,588 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:30:49,591 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:30:49,606 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:30:49,634 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:30:49,635 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:30:49,635 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:30:49,635 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:30:49,635 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:30:49,635 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:30:49,635 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:30:49,635 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:30:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 23:30:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:30:49,661 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:49,662 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:49,662 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2021-05-02 23:30:49,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:49,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004104526] [2021-05-02 23:30:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:49,743 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:49,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:49,965 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-02 23:30:49,967 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:49,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004104526] [2021-05-02 23:30:49,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004104526] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:49,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:49,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:30:49,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736188020] [2021-05-02 23:30:49,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:30:49,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:30:49,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:30:49,988 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-02 23:30:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:50,234 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2021-05-02 23:30:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:30:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2021-05-02 23:30:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:50,242 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:30:50,243 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:30:50,246 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:30:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:30:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:30:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 23:30:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-02 23:30:50,291 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2021-05-02 23:30:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:50,292 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-02 23:30:50,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-02 23:30:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-02 23:30:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:30:50,293 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:50,293 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:50,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:30:50,293 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2021-05-02 23:30:50,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:50,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528849471] [2021-05-02 23:30:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:50,297 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,398 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-02 23:30:50,398 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:50,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528849471] [2021-05-02 23:30:50,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1528849471] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:50,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:50,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:50,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52825553] [2021-05-02 23:30:50,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:50,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:50,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:50,401 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-02 23:30:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:50,668 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2021-05-02 23:30:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2021-05-02 23:30:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:50,672 INFO L225 Difference]: With dead ends: 49 [2021-05-02 23:30:50,672 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:30:50,675 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 97.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:30:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:30:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 23:30:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2021-05-02 23:30:50,713 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2021-05-02 23:30:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:50,713 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2021-05-02 23:30:50,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-02 23:30:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2021-05-02 23:30:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:30:50,716 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:50,716 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:50,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:30:50,716 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2021-05-02 23:30:50,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:50,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587701394] [2021-05-02 23:30:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:50,728 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 23:30:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:50,842 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-02 23:30:50,842 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:50,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587701394] [2021-05-02 23:30:50,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587701394] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:50,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:50,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:50,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821797649] [2021-05-02 23:30:50,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:50,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:50,845 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-02 23:30:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:51,225 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2021-05-02 23:30:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2021-05-02 23:30:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:51,227 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:30:51,227 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 23:30:51,228 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 173.7ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:30:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 23:30:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-05-02 23:30:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 23:30:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2021-05-02 23:30:51,238 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2021-05-02 23:30:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:51,238 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-05-02 23:30:51,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-02 23:30:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2021-05-02 23:30:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:30:51,239 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:51,239 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:51,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:30:51,239 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2021-05-02 23:30:51,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:51,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819424294] [2021-05-02 23:30:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:51,242 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:51,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:51,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:30:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:51,328 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-02 23:30:51,328 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:51,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819424294] [2021-05-02 23:30:51,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1819424294] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:51,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:51,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:51,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002518881] [2021-05-02 23:30:51,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:51,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:51,330 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-02 23:30:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:51,687 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2021-05-02 23:30:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2021-05-02 23:30:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:51,689 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:30:51,689 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 23:30:51,689 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 187.1ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:30:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 23:30:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2021-05-02 23:30:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-02 23:30:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-05-02 23:30:51,722 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2021-05-02 23:30:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:51,723 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-05-02 23:30:51,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-02 23:30:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-05-02 23:30:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 23:30:51,725 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:51,725 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:51,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:30:51,725 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2021-05-02 23:30:51,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:51,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588322117] [2021-05-02 23:30:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:51,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= |v_main_#t~nondet5_7| 0) (not (= v_main_~t~0_52 v_main_~tagbuf_len~0_31)) (<= v_main_~t~0_52 v_main_~tagbuf_len~0_31) (<= 0 v_main_~t~0_52)) InVars {main_#t~nondet5=|v_main_#t~nondet5_7|, main_~t~0=v_main_~t~0_52, main_~tagbuf_len~0=v_main_~tagbuf_len~0_31} OutVars{main_#t~nondet5=|v_main_#t~nondet5_7|, main_~t~0=v_main_~t~0_52, main_~tagbuf_len~0=v_main_~tagbuf_len~0_31} AuxVars[] AssignedVars[] [2021-05-02 23:30:51,785 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.9 percent of original size [2021-05-02 23:30:51,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:51,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:51,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:30:51,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:51,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:30:51,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:30:51,895 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.9 percent of original size 102 [2021-05-02 23:30:51,923 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:51,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:52,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:30:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:52,021 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-02 23:30:52,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,374 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:30:52,445 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:52,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588322117] [2021-05-02 23:30:52,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1588322117] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:52,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:52,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:30:52,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494596792] [2021-05-02 23:30:52,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:30:52,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:52,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:30:52,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:30:52,449 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:30:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:53,150 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-05-02 23:30:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:30:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2021-05-02 23:30:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:53,156 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:30:53,156 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 23:30:53,157 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 668.7ms TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:30:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 23:30:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-05-02 23:30:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-02 23:30:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2021-05-02 23:30:53,171 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 34 [2021-05-02 23:30:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2021-05-02 23:30:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:30:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2021-05-02 23:30:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:30:53,173 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:53,173 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 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-02 23:30:53,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:30:53,173 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1506705033, now seen corresponding path program 1 times [2021-05-02 23:30:53,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:53,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608159697] [2021-05-02 23:30:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:53,176 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:30:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:30:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:30:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,361 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-02 23:30:53,361 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:53,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608159697] [2021-05-02 23:30:53,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [608159697] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:53,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:53,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:30:53,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733342644] [2021-05-02 23:30:53,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:30:53,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:53,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:30:53,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:53,363 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:30:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:53,799 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2021-05-02 23:30:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:30:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2021-05-02 23:30:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:53,802 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:30:53,802 INFO L226 Difference]: Without dead ends: 90 [2021-05-02 23:30:53,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 203.7ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:30:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-02 23:30:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-05-02 23:30:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 24 states have call successors, (24), 9 states have call predecessors, (24), 7 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 23:30:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2021-05-02 23:30:53,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 35 [2021-05-02 23:30:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:53,821 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2021-05-02 23:30:53,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 23:30:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2021-05-02 23:30:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:30:53,823 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:53,823 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 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-02 23:30:53,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:30:53,823 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash 110874648, now seen corresponding path program 1 times [2021-05-02 23:30:53,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:53,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117378447] [2021-05-02 23:30:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:53,826 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:30:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:30:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:30:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:30:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 23:30:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 23:30:53,947 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:53,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117378447] [2021-05-02 23:30:53,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2117378447] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:53,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:53,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:30:53,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361815338] [2021-05-02 23:30:53,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:30:53,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:53,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:30:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:53,949 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 23:30:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:54,301 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2021-05-02 23:30:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2021-05-02 23:30:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:54,302 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:30:54,302 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:30:54,303 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:30:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:30:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:30:54,304 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-02 23:30:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:30:54,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-05-02 23:30:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:30:54,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 23:30:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:30:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:30:54,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:30:54,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:30:55,792 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:30:55,793 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:30:55,793 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 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-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:55,793 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:30:55,793 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:55,794 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:55,794 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,794 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 77) the Hoare annotation is: true [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L56-1(line 56) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,794 INFO L194 CegarLoopUtils]: At program point L48-3(lines 48 72) the Hoare annotation is: (let ((.cse0 (= (ite (<= 0 main_~t~0) 1 0) 1))) (or (and (<= main_~t~0 1) (< 0 main_~tagbuf_len~0) .cse0) (and (< main_~t~0 main_~tagbuf_len~0) .cse0))) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (= (ite (<= 0 main_~t~0) 1 0) 1))) (or (and (<= main_~t~0 1) (< 0 main_~tagbuf_len~0) .cse0) (and (< main_~t~0 main_~tagbuf_len~0) .cse0))) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L69(line 69) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L32-2(lines 32 44) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L49(lines 49 53) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,795 INFO L201 CegarLoopUtils]: At program point L74(lines 25 77) the Hoare annotation is: true [2021-05-02 23:30:55,795 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L70(line 70) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L66(lines 66 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L33(lines 33 37) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L201 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: true [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L54(lines 54 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,796 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,797 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 77) the Hoare annotation is: true [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= (ite (<= 0 main_~t~0) 1 0) 1) (< main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L38(lines 38 40) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2021-05-02 23:30:55,797 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L59(lines 59 63) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L55(lines 55 64) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (= (ite (<= 0 main_~t~0) 1 0) 1)) [2021-05-02 23:30:55,797 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~t~0_BEFORE_CALL_2 Int) (v_main_~tagbuf_len~0_BEFORE_CALL_2 Int)) (or (not (= (ite (<= 0 v_main_~t~0_BEFORE_CALL_2) 1 0) 1)) (not (= (ite (<= v_main_~t~0_BEFORE_CALL_2 v_main_~tagbuf_len~0_BEFORE_CALL_2) 1 0) |__VERIFIER_assert_#in~cond|))))))) [2021-05-02 23:30:55,797 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:30:55,798 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~t~0_BEFORE_CALL_2 Int) (v_main_~tagbuf_len~0_BEFORE_CALL_2 Int)) (or (not (= (ite (<= 0 v_main_~t~0_BEFORE_CALL_2) 1 0) 1)) (not (= (ite (<= v_main_~t~0_BEFORE_CALL_2 v_main_~tagbuf_len~0_BEFORE_CALL_2) 1 0) |__VERIFIER_assert_#in~cond|))))))) [2021-05-02 23:30:55,798 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:30:55,798 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:30:55,798 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (not (= __VERIFIER_assert_~cond 0))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~t~0_BEFORE_CALL_2 Int) (v_main_~tagbuf_len~0_BEFORE_CALL_2 Int)) (or (not (= (ite (<= 0 v_main_~t~0_BEFORE_CALL_2) 1 0) 1)) (not (= (ite (<= v_main_~t~0_BEFORE_CALL_2 v_main_~tagbuf_len~0_BEFORE_CALL_2) 1 0) |__VERIFIER_assert_#in~cond|))))))) [2021-05-02 23:30:55,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:30:55 BoogieIcfgContainer [2021-05-02 23:30:55,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:30:55,815 INFO L168 Benchmark]: Toolchain (without parser) took 6949.51 ms. Allocated memory was 182.5 MB in the beginning and 270.5 MB in the end (delta: 88.1 MB). Free memory was 147.9 MB in the beginning and 205.5 MB in the end (delta: -57.6 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:55,816 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 182.5 MB. Free memory is still 164.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:30:55,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.60 ms. Allocated memory is still 182.5 MB. Free memory was 147.7 MB in the beginning and 166.3 MB in the end (delta: -18.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:55,816 INFO L168 Benchmark]: Boogie Preprocessor took 50.20 ms. Allocated memory is still 182.5 MB. Free memory was 166.3 MB in the beginning and 164.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:55,816 INFO L168 Benchmark]: RCFGBuilder took 414.43 ms. Allocated memory is still 182.5 MB. Free memory was 164.4 MB in the beginning and 146.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:55,817 INFO L168 Benchmark]: TraceAbstraction took 6236.55 ms. Allocated memory was 182.5 MB in the beginning and 270.5 MB in the end (delta: 88.1 MB). Free memory was 146.1 MB in the beginning and 205.5 MB in the end (delta: -59.4 MB). Peak memory consumption was 140.3 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:55,818 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.14 ms. Allocated memory is still 182.5 MB. Free memory is still 164.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.60 ms. Allocated memory is still 182.5 MB. Free memory was 147.7 MB in the beginning and 166.3 MB in the end (delta: -18.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 50.20 ms. Allocated memory is still 182.5 MB. Free memory was 166.3 MB in the beginning and 164.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 414.43 ms. Allocated memory is still 182.5 MB. Free memory was 164.4 MB in the beginning and 146.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6236.55 ms. Allocated memory was 182.5 MB in the beginning and 270.5 MB in the end (delta: 88.1 MB). Free memory was 146.1 MB in the beginning and 205.5 MB in the end (delta: -59.4 MB). Peak memory consumption was 140.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_CALL_2,QUANTIFIED] * 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, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4673.6ms, OverallIterations: 7, TraceHistogramMax: 6, EmptinessCheckTime: 18.8ms, AutomataDifference: 2796.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1486.1ms, InitialAbstractionConstructionTime: 13.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 261 SDtfs, 408 SDslu, 335 SDs, 0 SdLazy, 1122 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1229.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1558.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 144.4ms AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 48 LocationsWithAnnotation, 318 PreInvPairs, 463 NumberOfFragments, 513 HoareAnnotationTreeSize, 318 FomulaSimplifications, 5381 FormulaSimplificationTreeSizeReduction, 439.5ms HoareSimplificationTime, 48 FomulaSimplificationsInter, 2958 FormulaSimplificationTreeSizeReductionInter, 1000.9ms 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: 32]: Loop Invariant Derived loop invariant: t <= tagbuf_len && (if 0 <= t then 1 else 0) == 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (t <= tagbuf_len && 1 <= tagbuf_len) && (if 0 <= t then 1 else 0) == 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2021-05-02 23:30:55,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_BEFORE_CALL_2,QUANTIFIED] [2021-05-02 23:30:55,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_CALL_2,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (\old(cond) == 0 || !(cond == 0)) && ((\old(cond) == 0 || \old(cond) == cond) || (forall v_main_~t~0_BEFORE_CALL_2 : int, v_main_~tagbuf_len~0_BEFORE_CALL_2 : int :: !((if 0 <= v_main_~t~0_BEFORE_CALL_2 then 1 else 0) == 1) || !((if v_main_~t~0_BEFORE_CALL_2 <= v_main_~tagbuf_len~0_BEFORE_CALL_2 then 1 else 0) == \old(cond)))) RESULT: Ultimate proved your program to be correct! Received shutdown request...