/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:37:21,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:37:21,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:37:21,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:37:21,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:37:21,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:37:21,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:37:21,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:37:21,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:37:21,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:37:21,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:37:21,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:37:21,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:37:21,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:37:21,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:37:21,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:37:21,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:37:21,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:37:21,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:37:21,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:37:21,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:37:21,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:37:21,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:37:21,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:37:21,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:37:21,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:37:21,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:37:21,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:37:21,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:37:21,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:37:21,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:37:21,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:37:21,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:37:21,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:37:21,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:37:21,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:37:21,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:37:21,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:37:21,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:37:21,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:37:21,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:37:21,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:37:21,238 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:37:21,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:37:21,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:37:21,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:37:21,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:37:21,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:37:21,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:37:21,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:37:21,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:37:21,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:37:21,241 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:37:21,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:37:21,242 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:37:21,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:37:21,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:37:21,242 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:37:21,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:37:21,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:37:21,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:37:21,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:37:21,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:37:21,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:37:21,244 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.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:37:21,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:37:21,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:37:21,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:37:21,630 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:37:21,634 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:37:21,635 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 [2020-11-07 06:37:21,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0636bb1/5b133f215dda44b2b374ed696f6f85f9/FLAG51dc6fe2a [2020-11-07 06:37:22,356 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:37:22,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-11-07 06:37:22,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0636bb1/5b133f215dda44b2b374ed696f6f85f9/FLAG51dc6fe2a [2020-11-07 06:37:22,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0636bb1/5b133f215dda44b2b374ed696f6f85f9 [2020-11-07 06:37:22,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:37:22,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:37:22,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:37:22,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:37:22,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:37:22,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:37:22" (1/1) ... [2020-11-07 06:37:22,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282e23c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:22, skipping insertion in model container [2020-11-07 06:37:22,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:37:22" (1/1) ... [2020-11-07 06:37:22,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:37:22,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:37:22,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:37:22,945 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:37:22,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:37:23,012 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:37:23,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23 WrapperNode [2020-11-07 06:37:23,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:37:23,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:37:23,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:37:23,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:37:23,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (1/1) ... [2020-11-07 06:37:23,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:37:23,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:37:23,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:37:23,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:37:23,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (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 [2020-11-07 06:37:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:37:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:37:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:37:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:37:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:37:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:37:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:37:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:37:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:37:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:37:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:37:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:37:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:37:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:37:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:37:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:37:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:37:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:37:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:37:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:37:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:37:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:37:23,898 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:37:23,899 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 06:37:23,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:37:23 BoogieIcfgContainer [2020-11-07 06:37:23,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:37:23,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:37:23,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:37:23,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:37:23,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:37:22" (1/3) ... [2020-11-07 06:37:23,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613d20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:37:23, skipping insertion in model container [2020-11-07 06:37:23,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:37:23" (2/3) ... [2020-11-07 06:37:23,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613d20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:37:23, skipping insertion in model container [2020-11-07 06:37:23,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:37:23" (3/3) ... [2020-11-07 06:37:23,910 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-11-07 06:37:23,924 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:37:23,928 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:37:23,940 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:37:23,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:37:23,962 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:37:23,963 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:37:23,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:37:23,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:37:23,963 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:37:23,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:37:23,963 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:37:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-11-07 06:37:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 06:37:23,992 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:23,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:23,994 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1591405496, now seen corresponding path program 1 times [2020-11-07 06:37:24,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:24,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1176494118] [2020-11-07 06:37:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:24,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:37:24,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1176494118] [2020-11-07 06:37:24,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:24,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:37:24,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307849981] [2020-11-07 06:37:24,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:37:24,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:37:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:37:24,453 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 7 states. [2020-11-07 06:37:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:25,516 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2020-11-07 06:37:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:37:25,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-11-07 06:37:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:25,530 INFO L225 Difference]: With dead ends: 193 [2020-11-07 06:37:25,530 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 06:37:25,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 06:37:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2020-11-07 06:37:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 06:37:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2020-11-07 06:37:25,613 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 39 [2020-11-07 06:37:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:25,613 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2020-11-07 06:37:25,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:37:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2020-11-07 06:37:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 06:37:25,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:25,618 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:25,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:37:25,618 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1635530832, now seen corresponding path program 1 times [2020-11-07 06:37:25,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:25,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145623926] [2020-11-07 06:37:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:37:25,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2145623926] [2020-11-07 06:37:25,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:25,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:37:25,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112704855] [2020-11-07 06:37:25,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:37:25,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:37:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:37:25,861 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand 8 states. [2020-11-07 06:37:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:26,545 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2020-11-07 06:37:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:37:26,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-11-07 06:37:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:26,550 INFO L225 Difference]: With dead ends: 110 [2020-11-07 06:37:26,550 INFO L226 Difference]: Without dead ends: 106 [2020-11-07 06:37:26,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-07 06:37:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-07 06:37:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-07 06:37:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2020-11-07 06:37:26,579 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 44 [2020-11-07 06:37:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:26,579 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2020-11-07 06:37:26,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:37:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2020-11-07 06:37:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 06:37:26,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:26,583 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:26,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:37:26,583 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1417093932, now seen corresponding path program 1 times [2020-11-07 06:37:26,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:26,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917114932] [2020-11-07 06:37:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:37:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-07 06:37:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:37:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:37:26,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917114932] [2020-11-07 06:37:26,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:26,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:37:26,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109332900] [2020-11-07 06:37:26,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:37:26,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:37:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:37:26,717 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 4 states. [2020-11-07 06:37:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:27,044 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2020-11-07 06:37:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:37:27,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-07 06:37:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:27,047 INFO L225 Difference]: With dead ends: 151 [2020-11-07 06:37:27,047 INFO L226 Difference]: Without dead ends: 106 [2020-11-07 06:37:27,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:37:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-07 06:37:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-07 06:37:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-07 06:37:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2020-11-07 06:37:27,072 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 74 [2020-11-07 06:37:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:27,073 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2020-11-07 06:37:27,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:37:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2020-11-07 06:37:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 06:37:27,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:27,075 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:27,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:37:27,076 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1237786455, now seen corresponding path program 1 times [2020-11-07 06:37:27,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:27,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597002264] [2020-11-07 06:37:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:37:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:37:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:37:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:37:27,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597002264] [2020-11-07 06:37:27,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:27,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:37:27,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131218149] [2020-11-07 06:37:27,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:37:27,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:37:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:37:27,318 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 8 states. [2020-11-07 06:37:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:28,024 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2020-11-07 06:37:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:37:28,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2020-11-07 06:37:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:28,029 INFO L225 Difference]: With dead ends: 114 [2020-11-07 06:37:28,030 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 06:37:28,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 06:37:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-07 06:37:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 06:37:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2020-11-07 06:37:28,077 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 77 [2020-11-07 06:37:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:28,078 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2020-11-07 06:37:28,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:37:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2020-11-07 06:37:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-11-07 06:37:28,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:28,082 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:28,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:37:28,082 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 84471203, now seen corresponding path program 1 times [2020-11-07 06:37:28,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:28,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093367028] [2020-11-07 06:37:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:37:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:37:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:37:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:37:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:37:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-07 06:37:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-07 06:37:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:37:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:37:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-11-07 06:37:28,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093367028] [2020-11-07 06:37:28,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:28,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:37:28,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933940849] [2020-11-07 06:37:28,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:37:28,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:37:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:37:28,283 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 7 states. [2020-11-07 06:37:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:28,969 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2020-11-07 06:37:28,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:37:28,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2020-11-07 06:37:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:28,975 INFO L225 Difference]: With dead ends: 123 [2020-11-07 06:37:28,975 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 06:37:28,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 06:37:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2020-11-07 06:37:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-07 06:37:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2020-11-07 06:37:29,013 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 123 [2020-11-07 06:37:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:29,014 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2020-11-07 06:37:29,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:37:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2020-11-07 06:37:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-11-07 06:37:29,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:29,017 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:29,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:37:29,017 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -749261739, now seen corresponding path program 1 times [2020-11-07 06:37:29,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:29,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768418776] [2020-11-07 06:37:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:37:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:37:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:37:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:37:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:37:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-07 06:37:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-07 06:37:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:37:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:37:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 06:37:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-11-07 06:37:29,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768418776] [2020-11-07 06:37:29,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:37:29,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:37:29,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932023583] [2020-11-07 06:37:29,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:37:29,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:37:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:37:29,231 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 7 states. [2020-11-07 06:37:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:29,890 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2020-11-07 06:37:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:37:29,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-11-07 06:37:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:29,892 INFO L225 Difference]: With dead ends: 126 [2020-11-07 06:37:29,892 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:37:29,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:37:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:37:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:37:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:37:29,895 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2020-11-07 06:37:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:29,895 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:37:29,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:37:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:37:29,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:37:29,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:37:29,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:37:30,727 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:30,883 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:31,014 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:31,590 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:31,955 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-11-07 06:37:32,525 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:32,737 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:32,957 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:33,160 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-11-07 06:37:33,507 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,507 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,507 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,508 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,509 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,509 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,509 INFO L262 CegarLoopResult]: 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)|)) [2020-11-07 06:37:33,509 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:37:33,509 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,509 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,510 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,510 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,510 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:37:33,510 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:37:33,510 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:37:33,510 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:37:33,510 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:37:33,510 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:37:33,511 INFO L262 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,511 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:37:33,511 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 06:37:33,511 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2020-11-07 06:37:33,511 INFO L262 CegarLoopResult]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,511 INFO L262 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,512 INFO L262 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: (and (<= (+ main_~cp~0 1) main_~urilen~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-11-07 06:37:33,512 INFO L262 CegarLoopResult]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,512 INFO L269 CegarLoopResult]: At program point L36(lines 25 83) the Hoare annotation is: true [2020-11-07 06:37:33,512 INFO L262 CegarLoopResult]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,513 INFO L262 CegarLoopResult]: At program point L69-2(line 69) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,513 INFO L262 CegarLoopResult]: At program point L69-3(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,513 INFO L262 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,513 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 06:37:33,513 INFO L262 CegarLoopResult]: At program point L61-1(lines 61 79) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,514 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 06:37:33,514 INFO L262 CegarLoopResult]: At program point L61-2(line 61) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,514 INFO L269 CegarLoopResult]: At program point L61-3(line 61) the Hoare annotation is: true [2020-11-07 06:37:33,514 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,514 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,515 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,515 INFO L262 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,515 INFO L262 CegarLoopResult]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-11-07 06:37:33,515 INFO L262 CegarLoopResult]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,515 INFO L262 CegarLoopResult]: At program point L70-2(line 70) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,516 INFO L262 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,516 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 06:37:33,516 INFO L269 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-11-07 06:37:33,516 INFO L269 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-11-07 06:37:33,516 INFO L262 CegarLoopResult]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,516 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2020-11-07 06:37:33,516 INFO L262 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,517 INFO L262 CegarLoopResult]: At program point L71-1(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,517 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,517 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 06:37:33,517 INFO L262 CegarLoopResult]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 main_~scheme~0) (= main_~c~0 0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,517 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2020-11-07 06:37:33,518 INFO L269 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-11-07 06:37:33,518 INFO L269 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-11-07 06:37:33,518 INFO L262 CegarLoopResult]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,518 INFO L262 CegarLoopResult]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,518 INFO L262 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,518 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 06:37:33,518 INFO L269 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-11-07 06:37:33,519 INFO L269 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-11-07 06:37:33,519 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,519 INFO L262 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,519 INFO L269 CegarLoopResult]: At program point L81(lines 25 83) the Hoare annotation is: true [2020-11-07 06:37:33,519 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,519 INFO L262 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,519 INFO L262 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,520 INFO L262 CegarLoopResult]: At program point L48-4(line 48) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,520 INFO L262 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,520 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 06:37:33,520 INFO L262 CegarLoopResult]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3))) [2020-11-07 06:37:33,520 INFO L269 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-11-07 06:37:33,520 INFO L262 CegarLoopResult]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,521 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,521 INFO L262 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,521 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2020-11-07 06:37:33,521 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 06:37:33,521 INFO L269 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-11-07 06:37:33,521 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,521 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,522 INFO L262 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,522 INFO L262 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,522 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 06:37:33,522 INFO L262 CegarLoopResult]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,522 INFO L269 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-11-07 06:37:33,522 INFO L262 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,523 INFO L262 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,523 INFO L262 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,523 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,523 INFO L262 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,523 INFO L262 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,524 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= 1 main_~cp~0) (<= (+ main_~scheme~0 1) main_~urilen~0) (< main_~cp~0 main_~urilen~0)) [2020-11-07 06:37:33,524 INFO L262 CegarLoopResult]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4))) [2020-11-07 06:37:33,524 INFO L262 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 main_~scheme~0)) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse4 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse5 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 (= main_~c~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-07 06:37:33,524 INFO L269 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-11-07 06:37:33,524 INFO L269 CegarLoopResult]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2020-11-07 06:37:33,524 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:37:33,525 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:37:33,525 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:37:33,525 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:37:33,525 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:37:33,525 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:37:33,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:37:33 BoogieIcfgContainer [2020-11-07 06:37:33,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:37:33,548 INFO L168 Benchmark]: Toolchain (without parser) took 10845.76 ms. Allocated memory was 152.0 MB in the beginning and 283.1 MB in the end (delta: 131.1 MB). Free memory was 128.4 MB in the beginning and 211.5 MB in the end (delta: -83.1 MB). Peak memory consumption was 161.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:37:33,548 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 97.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:37:33,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.22 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 117.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:37:33,550 INFO L168 Benchmark]: Boogie Preprocessor took 83.46 ms. Allocated memory is still 152.0 MB. Free memory was 117.4 MB in the beginning and 115.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:37:33,551 INFO L168 Benchmark]: RCFGBuilder took 800.14 ms. Allocated memory is still 152.0 MB. Free memory was 115.7 MB in the beginning and 119.3 MB in the end (delta: -3.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:37:33,552 INFO L168 Benchmark]: TraceAbstraction took 9642.83 ms. Allocated memory was 152.0 MB in the beginning and 283.1 MB in the end (delta: 131.1 MB). Free memory was 118.9 MB in the beginning and 211.5 MB in the end (delta: -92.6 MB). Peak memory consumption was 151.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:37:33,555 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.23 ms. Allocated memory is still 125.8 MB. Free memory is still 97.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 305.22 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 117.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.46 ms. Allocated memory is still 152.0 MB. Free memory was 117.4 MB in the beginning and 115.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 800.14 ms. Allocated memory is still 152.0 MB. Free memory was 115.7 MB in the beginning and 119.3 MB in the end (delta: -3.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9642.83 ms. Allocated memory was 152.0 MB in the beginning and 283.1 MB in the end (delta: 131.1 MB). Free memory was 118.9 MB in the beginning and 211.5 MB in the end (delta: -92.6 MB). Peak memory consumption was 151.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((0 < scheme && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((0 < scheme && c == 0) && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen) || ((((1 <= c && 0 < scheme) && 1 <= cp) && scheme + 1 <= urilen) && cp < urilen) - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 14, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 663 SDslu, 574 SDs, 0 SdLazy, 1774 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 105 LocationsWithAnnotation, 435 PreInvPairs, 564 NumberOfFragments, 1524 HoareAnnotationTreeSize, 435 FomulaSimplifications, 1648 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 105 FomulaSimplificationsInter, 2776 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 74955 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...