/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-05 23:54:57,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-05 23:54:57,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-05 23:54:57,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-05 23:54:57,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-05 23:54:57,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-05 23:54:57,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-05 23:54:57,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-05 23:54:57,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-05 23:54:57,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-05 23:54:57,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-05 23:54:57,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-05 23:54:57,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-05 23:54:57,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-05 23:54:57,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-05 23:54:57,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-05 23:54:57,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-05 23:54:57,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-05 23:54:57,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-05 23:54:57,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-05 23:54:57,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-05 23:54:57,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-05 23:54:57,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-05 23:54:57,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-05 23:54:57,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-05 23:54:57,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-05 23:54:57,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-05 23:54:57,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-05 23:54:57,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-05 23:54:57,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-05 23:54:57,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-05 23:54:57,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-05 23:54:57,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-05 23:54:57,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-05 23:54:57,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-05 23:54:57,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-05 23:54:57,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-05 23:54:57,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-05 23:54:57,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-05 23:54:57,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-05 23:54:57,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-05 23:54:57,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-05 23:54:57,637 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-05 23:54:57,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-05 23:54:57,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-05 23:54:57,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-05 23:54:57,639 INFO L138 SettingsManager]: * Use SBE=true [2021-05-05 23:54:57,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-05 23:54:57,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-05 23:54:57,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-05 23:54:57,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-05 23:54:57,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-05 23:54:57,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-05 23:54:57,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:57,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-05 23:54:57,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-05 23:54:57,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-05 23:54:57,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-05 23:54:57,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-05 23:54:57,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-05 23:54:57,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-05 23:54:57,889 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-05 23:54:57,890 INFO L275 PluginConnector]: CDTParser initialized [2021-05-05 23:54:57,890 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-05 23:54:57,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316706286/c67c351565164d34838df7f1aa5f185f/FLAG5a60c27ab [2021-05-05 23:54:58,294 INFO L306 CDTParser]: Found 1 translation units. [2021-05-05 23:54:58,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2021-05-05 23:54:58,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316706286/c67c351565164d34838df7f1aa5f185f/FLAG5a60c27ab [2021-05-05 23:54:58,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316706286/c67c351565164d34838df7f1aa5f185f [2021-05-05 23:54:58,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-05 23:54:58,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-05 23:54:58,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:58,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-05 23:54:58,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-05 23:54:58,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd092ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58, skipping insertion in model container [2021-05-05 23:54:58,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-05 23:54:58,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-05 23:54:58,461 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-05 23:54:58,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:58,509 INFO L203 MainTranslator]: Completed pre-run [2021-05-05 23:54:58,526 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-05 23:54:58,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:58,555 INFO L208 MainTranslator]: Completed translation [2021-05-05 23:54:58,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58 WrapperNode [2021-05-05 23:54:58,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:58,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-05 23:54:58,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-05 23:54:58,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-05 23:54:58,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (1/1) ... [2021-05-05 23:54:58,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-05 23:54:58,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-05 23:54:58,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-05 23:54:58,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-05 23:54:58,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (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-05 23:54:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-05 23:54:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-05 23:54:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-05 23:54:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-05 23:54:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-05 23:54:58,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-05 23:54:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-05 23:54:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-05 23:54:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-05 23:54:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-05 23:54:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-05 23:54:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-05 23:54:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-05 23:54:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-05 23:54:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-05 23:54:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-05 23:54:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-05 23:54:58,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-05 23:54:58,925 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-05 23:54:58,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:58 BoogieIcfgContainer [2021-05-05 23:54:58,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-05 23:54:58,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-05 23:54:58,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-05 23:54:58,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-05 23:54:58,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:54:58" (1/3) ... [2021-05-05 23:54:58,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39508c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:58, skipping insertion in model container [2021-05-05 23:54:58,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:58" (2/3) ... [2021-05-05 23:54:58,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39508c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:58, skipping insertion in model container [2021-05-05 23:54:58,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:58" (3/3) ... [2021-05-05 23:54:58,931 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2021-05-05 23:54:58,934 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-05 23:54:58,937 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-05 23:54:58,948 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-05 23:54:58,962 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-05 23:54:58,962 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-05 23:54:58,962 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-05 23:54:58,962 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-05 23:54:58,962 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-05 23:54:58,962 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-05 23:54:58,963 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-05 23:54:58,963 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-05 23:54:58,973 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-05 23:54:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-05 23:54:58,976 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:58,976 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:58,976 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2021-05-05 23:54:58,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:58,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356920019] [2021-05-05 23:54:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:59,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:59,222 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-05 23:54:59,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:59,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356920019] [2021-05-05 23:54:59,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356920019] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:59,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:59,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:59,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631017140] [2021-05-05 23:54:59,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:59,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:59,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:59,239 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-05 23:54:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:59,766 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2021-05-05 23:54:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:59,767 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-05 23:54:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:59,774 INFO L225 Difference]: With dead ends: 112 [2021-05-05 23:54:59,774 INFO L226 Difference]: Without dead ends: 64 [2021-05-05 23:54:59,777 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 124.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-05 23:54:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2021-05-05 23:54:59,821 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-05 23:54:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-05-05 23:54:59,825 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2021-05-05 23:54:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:59,825 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-05-05 23:54:59,826 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-05 23:54:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-05-05 23:54:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-05 23:54:59,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:59,828 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-05 23:54:59,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-05 23:54:59,828 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2021-05-05 23:54:59,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:59,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089295785] [2021-05-05 23:54:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:59,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:59,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-05 23:54:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:59,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:59,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089295785] [2021-05-05 23:54:59,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089295785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:59,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:59,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:59,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231681030] [2021-05-05 23:54:59,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:59,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:59,954 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-05 23:55:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:55:00,232 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2021-05-05 23:55:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:55:00,232 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-05 23:55:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:55:00,234 INFO L225 Difference]: With dead ends: 63 [2021-05-05 23:55:00,234 INFO L226 Difference]: Without dead ends: 61 [2021-05-05 23:55:00,235 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 124.1ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:55:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-05 23:55:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-05 23:55:00,242 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-05 23:55:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2021-05-05 23:55:00,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2021-05-05 23:55:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:55:00,243 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2021-05-05 23:55:00,243 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-05 23:55:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2021-05-05 23:55:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-05 23:55:00,244 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:55:00,244 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-05 23:55:00,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-05 23:55:00,244 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:55:00,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:55:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2021-05-05 23:55:00,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:55:00,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932296896] [2021-05-05 23:55:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:55:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:55:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-05 23:55:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-05 23:55:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-05 23:55:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-05 23:55:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-05 23:55:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-05 23:55:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-05 23:55:00,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:55:00,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932296896] [2021-05-05 23:55:00,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932296896] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:55:00,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:55:00,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:55:00,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131963228] [2021-05-05 23:55:00,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:55:00,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:55:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:55:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:55:00,308 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-05 23:55:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:55:00,466 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2021-05-05 23:55:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-05 23:55:00,466 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-05 23:55:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:55:00,467 INFO L225 Difference]: With dead ends: 90 [2021-05-05 23:55:00,467 INFO L226 Difference]: Without dead ends: 61 [2021-05-05 23:55:00,468 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:55:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-05 23:55:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-05 23:55:00,475 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-05 23:55:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2021-05-05 23:55:00,476 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2021-05-05 23:55:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:55:00,476 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2021-05-05 23:55:00,476 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-05 23:55:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2021-05-05 23:55:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-05 23:55:00,477 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:55:00,477 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-05 23:55:00,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-05 23:55:00,477 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:55:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:55:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2021-05-05 23:55:00,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:55:00,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129302385] [2021-05-05 23:55:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:55:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:55:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-05 23:55:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-05 23:55:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-05 23:55:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-05 23:55:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:55:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-05 23:55:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-05 23:55:00,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:55:00,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129302385] [2021-05-05 23:55:00,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129302385] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:55:00,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:55:00,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:55:00,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678273906] [2021-05-05 23:55:00,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:55:00,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:55:00,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:55:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:55:00,593 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-05 23:55:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:55:00,882 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2021-05-05 23:55:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:55:00,883 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-05 23:55:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:55:00,884 INFO L225 Difference]: With dead ends: 68 [2021-05-05 23:55:00,884 INFO L226 Difference]: Without dead ends: 66 [2021-05-05 23:55:00,885 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 114.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:55:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-05 23:55:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-05-05 23:55:00,891 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-05 23:55:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2021-05-05 23:55:00,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2021-05-05 23:55:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:55:00,892 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2021-05-05 23:55:00,892 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-05 23:55:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2021-05-05 23:55:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-05 23:55:00,894 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:55:00,894 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-05 23:55:00,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-05 23:55:00,894 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:55:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:55:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2021-05-05 23:55:00,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:55:00,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701502165] [2021-05-05 23:55:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:55:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:55:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-05 23:55:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-05 23:55:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-05 23:55:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-05 23:55:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:55:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-05 23:55:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-05 23:55:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-05 23:55:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-05 23:55:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-05 23:55:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-05 23:55:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-05 23:55:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-05-05 23:55:00,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:55:00,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701502165] [2021-05-05 23:55:00,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701502165] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:55:00,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:55:00,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:55:00,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800455340] [2021-05-05 23:55:00,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:55:00,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:55:00,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:55:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:55:00,978 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-05 23:55:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:55:01,207 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2021-05-05 23:55:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:55:01,208 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-05 23:55:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:55:01,209 INFO L225 Difference]: With dead ends: 74 [2021-05-05 23:55:01,209 INFO L226 Difference]: Without dead ends: 72 [2021-05-05 23:55:01,209 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:55:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-05 23:55:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-05-05 23:55:01,216 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-05 23:55:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2021-05-05 23:55:01,216 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2021-05-05 23:55:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:55:01,217 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2021-05-05 23:55:01,217 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-05 23:55:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2021-05-05 23:55:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-05 23:55:01,218 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:55:01,218 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-05 23:55:01,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-05 23:55:01,218 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:55:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:55:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2021-05-05 23:55:01,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:55:01,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558534698] [2021-05-05 23:55:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:55:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:55:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-05 23:55:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-05 23:55:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-05 23:55:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-05 23:55:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:55:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-05 23:55:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-05 23:55:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-05 23:55:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-05 23:55:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-05 23:55:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-05 23:55:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-05 23:55:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-05-05 23:55:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:55:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-05-05 23:55:01,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:55:01,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558534698] [2021-05-05 23:55:01,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558534698] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:55:01,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:55:01,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:55:01,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142995131] [2021-05-05 23:55:01,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:55:01,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:55:01,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:55:01,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:55:01,295 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-05 23:55:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:55:01,552 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2021-05-05 23:55:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:55:01,553 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-05 23:55:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:55:01,553 INFO L225 Difference]: With dead ends: 75 [2021-05-05 23:55:01,553 INFO L226 Difference]: Without dead ends: 0 [2021-05-05 23:55:01,554 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:55:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-05 23:55:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-05 23:55:01,554 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-05 23:55:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-05 23:55:01,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2021-05-05 23:55:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:55:01,554 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-05 23:55:01,554 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-05 23:55:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-05 23:55:01,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-05 23:55:01,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-05 23:55:01,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-05 23:55:02,239 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:55:02,240 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-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-05 23:55:02,240 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2021-05-05 23:55:02,240 INFO L198 CegarLoopUtils]: For program point L44(lines 44 80) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L69(lines 69 75) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L36(lines 25 83) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L61(lines 61 79) no Hoare annotation was computed. [2021-05-05 23:55:02,241 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-05 23:55:02,241 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-05 23:55:02,241 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-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L37(lines 25 83) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point L54(lines 44 80) no Hoare annotation was computed. [2021-05-05 23:55:02,241 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2021-05-05 23:55:02,241 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-05 23:55:02,241 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-05 23:55:02,241 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-05 23:55:02,242 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-05 23:55:02,242 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2021-05-05 23:55:02,242 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-05 23:55:02,242 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-05 23:55:02,242 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-05 23:55:02,242 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-05 23:55:02,242 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-05 23:55:02,242 INFO L201 CegarLoopUtils]: At program point L81(lines 25 83) the Hoare annotation is: true [2021-05-05 23:55:02,242 INFO L198 CegarLoopUtils]: For program point L48(line 48) no Hoare annotation was computed. [2021-05-05 23:55:02,242 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-05 23:55:02,242 INFO L198 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-05-05 23:55:02,242 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-05 23:55:02,242 INFO L198 CegarLoopUtils]: For program point L57(lines 44 80) no Hoare annotation was computed. [2021-05-05 23:55:02,243 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-05 23:55:02,243 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-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L33(line 33) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-05-05 23:55:02,243 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-05 23:55:02,243 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-05 23:55:02,243 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-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L34(line 34) no Hoare annotation was computed. [2021-05-05 23:55:02,243 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-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L43(line 43) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2021-05-05 23:55:02,243 INFO L198 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2021-05-05 23:55:02,244 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-05-05 23:55:02,244 INFO L198 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-05-05 23:55:02,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:55:02 BoogieIcfgContainer [2021-05-05 23:55:02,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-05 23:55:02,254 INFO L168 Benchmark]: Toolchain (without parser) took 3935.63 ms. Allocated memory was 181.4 MB in the beginning and 221.2 MB in the end (delta: 39.8 MB). Free memory was 145.1 MB in the beginning and 118.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 8.0 GB. [2021-05-05 23:55:02,255 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 181.4 MB. Free memory is still 161.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-05 23:55:02,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.17 ms. Allocated memory is still 181.4 MB. Free memory was 145.0 MB in the beginning and 162.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 8.0 GB. [2021-05-05 23:55:02,255 INFO L168 Benchmark]: Boogie Preprocessor took 40.41 ms. Allocated memory is still 181.4 MB. Free memory was 162.8 MB in the beginning and 160.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:55:02,255 INFO L168 Benchmark]: RCFGBuilder took 329.76 ms. Allocated memory is still 181.4 MB. Free memory was 160.8 MB in the beginning and 140.3 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-05-05 23:55:02,256 INFO L168 Benchmark]: TraceAbstraction took 3326.27 ms. Allocated memory was 181.4 MB in the beginning and 221.2 MB in the end (delta: 39.8 MB). Free memory was 139.8 MB in the beginning and 118.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 104.9 MB. Max. memory is 8.0 GB. [2021-05-05 23:55:02,257 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.10 ms. Allocated memory is still 181.4 MB. Free memory is still 161.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 234.17 ms. Allocated memory is still 181.4 MB. Free memory was 145.0 MB in the beginning and 162.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.41 ms. Allocated memory is still 181.4 MB. Free memory was 162.8 MB in the beginning and 160.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 329.76 ms. Allocated memory is still 181.4 MB. Free memory was 160.8 MB in the beginning and 140.3 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3326.27 ms. Allocated memory was 181.4 MB in the beginning and 221.2 MB in the end (delta: 39.8 MB). Free memory was 139.8 MB in the beginning and 118.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 104.9 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: 2594.6ms, OverallIterations: 6, TraceHistogramMax: 14, EmptinessCheckTime: 11.1ms, AutomataDifference: 1773.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 684.0ms, InitialAbstractionConstructionTime: 7.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 294 SDtfs, 277 SDslu, 334 SDs, 0 SdLazy, 1031 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 912.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 571.0ms 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: 69.1ms AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 105 NumberOfFragments, 469 HoareAnnotationTreeSize, 76 FomulaSimplifications, 1072 FormulaSimplificationTreeSizeReduction, 118.5ms HoareSimplificationTime, 26 FomulaSimplificationsInter, 747 FormulaSimplificationTreeSizeReductionInter, 548.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 24.1ms SsaConstructionTime, 103.1ms SatisfiabilityAnalysisTime, 510.6ms InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, 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) RESULT: Ultimate proved your program to be correct! Received shutdown request...