/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 21:21:08,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 21:21:08,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 21:21:08,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 21:21:08,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 21:21:08,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 21:21:08,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 21:21:08,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 21:21:08,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 21:21:08,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 21:21:08,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 21:21:08,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 21:21:08,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 21:21:08,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 21:21:08,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 21:21:08,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 21:21:08,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 21:21:08,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 21:21:08,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 21:21:08,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 21:21:08,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 21:21:08,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 21:21:08,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 21:21:08,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 21:21:08,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 21:21:08,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 21:21:08,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 21:21:08,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 21:21:08,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 21:21:08,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 21:21:08,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 21:21:08,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 21:21:08,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 21:21:08,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 21:21:08,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 21:21:08,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 21:21:08,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 21:21:08,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 21:21:08,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 21:21:08,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 21:21:08,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 21:21:08,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 21:21:09,007 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 21:21:09,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 21:21:09,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 21:21:09,010 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 21:21:09,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 21:21:09,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 21:21:09,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 21:21:09,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 21:21:09,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 21:21:09,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 21:21:09,011 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 21:21:09,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 21:21:09,011 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 21:21:09,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 21:21:09,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 21:21:09,012 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 21:21:09,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 21:21:09,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 21:21:09,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 21:21:09,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 21:21:09,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 21:21:09,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 21:21:09,014 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 [2021-02-21 21:21:09,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 21:21:09,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 21:21:09,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 21:21:09,544 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 21:21:09,545 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 21:21:09,546 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-02-21 21:21:09,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4a5281e/1fb70de587ad4695bf0dd7943665db6c/FLAG9e5197463 [2021-02-21 21:21:10,413 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 21:21:10,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2021-02-21 21:21:10,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4a5281e/1fb70de587ad4695bf0dd7943665db6c/FLAG9e5197463 [2021-02-21 21:21:10,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4a5281e/1fb70de587ad4695bf0dd7943665db6c [2021-02-21 21:21:10,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 21:21:10,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 21:21:10,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 21:21:10,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 21:21:10,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 21:21:10,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 09:21:10" (1/1) ... [2021-02-21 21:21:10,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42fb1da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:10, skipping insertion in model container [2021-02-21 21:21:10,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 09:21:10" (1/1) ... [2021-02-21 21:21:10,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 21:21:10,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 21:21:11,008 WARN L226 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-02-21 21:21:11,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 21:21:11,047 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 21:21:11,067 WARN L226 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-02-21 21:21:11,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 21:21:11,129 INFO L208 MainTranslator]: Completed translation [2021-02-21 21:21:11,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11 WrapperNode [2021-02-21 21:21:11,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 21:21:11,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 21:21:11,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 21:21:11,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 21:21:11,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (1/1) ... [2021-02-21 21:21:11,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 21:21:11,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 21:21:11,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 21:21:11,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 21:21:11,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (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-02-21 21:21:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 21:21:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 21:21:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 21:21:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-21 21:21:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-21 21:21:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 21:21:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 21:21:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 21:21:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-02-21 21:21:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-02-21 21:21:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 21:21:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 21:21:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-21 21:21:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-21 21:21:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 21:21:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 21:21:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 21:21:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 21:21:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 21:21:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 21:21:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 21:21:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 21:21:11,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 21:21:11,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-02-21 21:21:11,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 09:21:11 BoogieIcfgContainer [2021-02-21 21:21:11,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 21:21:11,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 21:21:11,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 21:21:11,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 21:21:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 09:21:10" (1/3) ... [2021-02-21 21:21:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f02334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 09:21:11, skipping insertion in model container [2021-02-21 21:21:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 09:21:11" (2/3) ... [2021-02-21 21:21:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f02334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 09:21:11, skipping insertion in model container [2021-02-21 21:21:11,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 09:21:11" (3/3) ... [2021-02-21 21:21:11,979 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2021-02-21 21:21:12,014 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 21:21:12,020 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 21:21:12,042 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 21:21:12,082 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 21:21:12,082 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 21:21:12,082 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 21:21:12,082 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 21:21:12,082 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 21:21:12,083 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 21:21:12,083 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 21:21:12,083 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 21:21:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2021-02-21 21:21:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-02-21 21:21:12,135 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:12,136 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] [2021-02-21 21:21:12,137 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 982526872, now seen corresponding path program 1 times [2021-02-21 21:21:12,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:12,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987467715] [2021-02-21 21:21:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:12,266 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:12,560 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:12,564 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,566 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:21:12,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,600 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:21:12,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,620 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:12,639 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:12,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:12,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:12,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:12,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:21:12,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987467715] [2021-02-21 21:21:12,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:12,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 21:21:12,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529062182] [2021-02-21 21:21:12,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 21:21:12,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 21:21:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-21 21:21:12,770 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 7 states. [2021-02-21 21:21:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:13,740 INFO L93 Difference]: Finished difference Result 186 states and 281 transitions. [2021-02-21 21:21:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-21 21:21:13,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2021-02-21 21:21:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:13,775 INFO L225 Difference]: With dead ends: 186 [2021-02-21 21:21:13,775 INFO L226 Difference]: Without dead ends: 110 [2021-02-21 21:21:13,789 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 [2021-02-21 21:21:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-02-21 21:21:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2021-02-21 21:21:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-02-21 21:21:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2021-02-21 21:21:13,998 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 37 [2021-02-21 21:21:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:13,999 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2021-02-21 21:21:13,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 21:21:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2021-02-21 21:21:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-21 21:21:14,003 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:14,003 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] [2021-02-21 21:21:14,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 21:21:14,004 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1777685375, now seen corresponding path program 1 times [2021-02-21 21:21:14,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:14,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150073509] [2021-02-21 21:21:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:14,027 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:14,142 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:14,157 WARN L141 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-02-21 21:21:14,159 WARN L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-02-21 21:21:14,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,171 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:14,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:21:14,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:14,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:14,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:14,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:14,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:14,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-02-21 21:21:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:14,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:14,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 21:21:14,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150073509] [2021-02-21 21:21:14,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:14,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-21 21:21:14,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349876551] [2021-02-21 21:21:14,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-21 21:21:14,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-21 21:21:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-02-21 21:21:14,281 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 8 states. [2021-02-21 21:21:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:14,948 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2021-02-21 21:21:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-21 21:21:14,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2021-02-21 21:21:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:14,954 INFO L225 Difference]: With dead ends: 106 [2021-02-21 21:21:14,954 INFO L226 Difference]: Without dead ends: 104 [2021-02-21 21:21:14,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-02-21 21:21:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-02-21 21:21:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-02-21 21:21:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-02-21 21:21:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2021-02-21 21:21:14,991 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 42 [2021-02-21 21:21:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:14,992 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2021-02-21 21:21:14,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-21 21:21:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2021-02-21 21:21:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-21 21:21:14,995 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:14,995 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] [2021-02-21 21:21:14,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 21:21:14,996 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1379557309, now seen corresponding path program 1 times [2021-02-21 21:21:14,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:14,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660328948] [2021-02-21 21:21:14,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:15,000 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,061 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-21 21:21:15,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,075 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-02-21 21:21:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:21:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,148 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 21:21:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-02-21 21:21:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-02-21 21:21:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,188 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-21 21:21:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-21 21:21:15,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660328948] [2021-02-21 21:21:15,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:15,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 21:21:15,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552779170] [2021-02-21 21:21:15,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 21:21:15,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 21:21:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 21:21:15,228 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 4 states. [2021-02-21 21:21:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:15,564 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2021-02-21 21:21:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 21:21:15,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-02-21 21:21:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:15,568 INFO L225 Difference]: With dead ends: 147 [2021-02-21 21:21:15,568 INFO L226 Difference]: Without dead ends: 104 [2021-02-21 21:21:15,570 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 [2021-02-21 21:21:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-02-21 21:21:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-02-21 21:21:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-02-21 21:21:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2021-02-21 21:21:15,598 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 72 [2021-02-21 21:21:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:15,599 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2021-02-21 21:21:15,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 21:21:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2021-02-21 21:21:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-21 21:21:15,602 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:15,603 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] [2021-02-21 21:21:15,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 21:21:15,603 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 302386887, now seen corresponding path program 1 times [2021-02-21 21:21:15,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:15,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [921922827] [2021-02-21 21:21:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:15,607 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:21:15,683 WARN L141 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-02-21 21:21:15,684 WARN L147 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size 3 [2021-02-21 21:21:15,693 WARN L141 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size [2021-02-21 21:21:15,695 WARN L147 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size 10 [2021-02-21 21:21:15,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:15,715 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,716 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:15,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-02-21 21:21:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:21:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,791 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,794 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 21:21:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-02-21 21:21:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 21:21:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,831 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,832 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-21 21:21:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:15,846 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:15,847 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-21 21:21:15,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [921922827] [2021-02-21 21:21:15,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:15,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-02-21 21:21:15,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501974374] [2021-02-21 21:21:15,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-21 21:21:15,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-21 21:21:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-02-21 21:21:15,864 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand 8 states. [2021-02-21 21:21:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:16,471 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2021-02-21 21:21:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-21 21:21:16,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2021-02-21 21:21:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:16,474 INFO L225 Difference]: With dead ends: 110 [2021-02-21 21:21:16,474 INFO L226 Difference]: Without dead ends: 108 [2021-02-21 21:21:16,475 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 [2021-02-21 21:21:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-21 21:21:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-21 21:21:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-21 21:21:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2021-02-21 21:21:16,504 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 75 [2021-02-21 21:21:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:16,504 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2021-02-21 21:21:16,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-21 21:21:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2021-02-21 21:21:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-02-21 21:21:16,507 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:16,508 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] [2021-02-21 21:21:16,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 21:21:16,508 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 255736435, now seen corresponding path program 1 times [2021-02-21 21:21:16,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:16,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654374027] [2021-02-21 21:21:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:16,513 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,653 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:21:16,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 21:21:16,667 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,668 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:16,672 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,673 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:16,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-02-21 21:21:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,717 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:21:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,721 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,721 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 21:21:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,725 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,726 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-02-21 21:21:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 21:21:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,735 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-21 21:21:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,738 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,739 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-02-21 21:21:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,742 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,743 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-02-21 21:21:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,746 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,747 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-02-21 21:21:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,751 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-21 21:21:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-02-21 21:21:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-02-21 21:21:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:16,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:16,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-02-21 21:21:16,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654374027] [2021-02-21 21:21:16,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:16,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 21:21:16,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235535258] [2021-02-21 21:21:16,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 21:21:16,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 21:21:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-02-21 21:21:16,781 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 7 states. [2021-02-21 21:21:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:17,300 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2021-02-21 21:21:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-21 21:21:17,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2021-02-21 21:21:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:17,304 INFO L225 Difference]: With dead ends: 119 [2021-02-21 21:21:17,304 INFO L226 Difference]: Without dead ends: 117 [2021-02-21 21:21:17,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-02-21 21:21:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-02-21 21:21:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2021-02-21 21:21:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-21 21:21:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2021-02-21 21:21:17,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 121 [2021-02-21 21:21:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:17,334 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2021-02-21 21:21:17,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 21:21:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2021-02-21 21:21:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-21 21:21:17,337 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 21:21:17,337 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] [2021-02-21 21:21:17,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 21:21:17,337 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 21:21:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 21:21:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash -649987322, now seen corresponding path program 1 times [2021-02-21 21:21:17,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 21:21:17,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214653825] [2021-02-21 21:21:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 21:21:17,341 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 21:21:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:21:17,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 21:21:17,395 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,396 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:17,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 21:21:17,408 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 21:21:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-02-21 21:21:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,454 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-21 21:21:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,464 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 21:21:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,471 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-02-21 21:21:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 21:21:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,487 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,489 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-21 21:21:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-02-21 21:21:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,498 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,499 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-02-21 21:21:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,502 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-02-21 21:21:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-21 21:21:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,513 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-02-21 21:21:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,518 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-02-21 21:21:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-02-21 21:21:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 21:21:17,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 21:21:17,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 21:21:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-02-21 21:21:17,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214653825] [2021-02-21 21:21:17,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 21:21:17,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 21:21:17,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807244020] [2021-02-21 21:21:17,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 21:21:17,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 21:21:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 21:21:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-21 21:21:17,559 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 7 states. [2021-02-21 21:21:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 21:21:18,146 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2021-02-21 21:21:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-21 21:21:18,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2021-02-21 21:21:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 21:21:18,148 INFO L225 Difference]: With dead ends: 124 [2021-02-21 21:21:18,148 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 21:21:18,149 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 [2021-02-21 21:21:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 21:21:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 21:21:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 21:21:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 21:21:18,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2021-02-21 21:21:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 21:21:18,151 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 21:21:18,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 21:21:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 21:21:18,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 21:21:18,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 21:21:18,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 21:21:18,997 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:19,139 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:19,262 WARN L202 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:19,811 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:20,628 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:20,862 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:21,090 WARN L202 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:21,283 WARN L202 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2021-02-21 21:21:21,580 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-02-21 21:21:21,580 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-02-21 21:21:21,580 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-02-21 21:21:21,580 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-02-21 21:21:21,580 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point L12-1(line 12) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L192 CegarLoopUtils]: At program point L12-2(line 12) the Hoare annotation is: true [2021-02-21 21:21:21,581 INFO L185 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-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point L12-3(line 12) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 21:21:21,582 INFO L189 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-02-21 21:21:21,582 INFO L189 CegarLoopUtils]: For program point L15-1(line 15) no Hoare annotation was computed. [2021-02-21 21:21:21,582 INFO L189 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-02-21 21:21:21,582 INFO L189 CegarLoopUtils]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2021-02-21 21:21:21,583 INFO L189 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-02-21 21:21:21,583 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,583 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-21 21:21:21,583 INFO L192 CegarLoopUtils]: At program point L27-1(line 27) the Hoare annotation is: true [2021-02-21 21:21:21,583 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2021-02-21 21:21:21,583 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,584 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,584 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,584 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,584 INFO L192 CegarLoopUtils]: At program point L36(lines 25 83) the Hoare annotation is: true [2021-02-21 21:21:21,584 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,585 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,585 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,585 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,585 INFO L192 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: true [2021-02-21 21:21:21,585 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,586 INFO L192 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: true [2021-02-21 21:21:21,586 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,586 INFO L192 CegarLoopUtils]: At program point L61-3(line 61) the Hoare annotation is: true [2021-02-21 21:21:21,586 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,586 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,586 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,587 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,587 INFO L185 CegarLoopUtils]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2021-02-21 21:21:21,587 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,587 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,588 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,588 INFO L192 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: true [2021-02-21 21:21:21,588 INFO L192 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: true [2021-02-21 21:21:21,588 INFO L192 CegarLoopUtils]: At program point L29-2(line 29) the Hoare annotation is: true [2021-02-21 21:21:21,588 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,588 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2021-02-21 21:21:21,588 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,588 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,588 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,589 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-21 21:21:21,589 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,589 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2021-02-21 21:21:21,589 INFO L192 CegarLoopUtils]: At program point L30-1(line 30) the Hoare annotation is: true [2021-02-21 21:21:21,589 INFO L192 CegarLoopUtils]: At program point L30-2(line 30) the Hoare annotation is: true [2021-02-21 21:21:21,589 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,589 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,589 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,590 INFO L192 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: true [2021-02-21 21:21:21,590 INFO L192 CegarLoopUtils]: At program point L31-1(line 31) the Hoare annotation is: true [2021-02-21 21:21:21,590 INFO L192 CegarLoopUtils]: At program point L31-2(line 31) the Hoare annotation is: true [2021-02-21 21:21:21,590 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,590 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,590 INFO L192 CegarLoopUtils]: At program point L81(lines 25 83) the Hoare annotation is: true [2021-02-21 21:21:21,591 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,591 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,591 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,591 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,591 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,591 INFO L192 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: true [2021-02-21 21:21:21,592 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,592 INFO L192 CegarLoopUtils]: At program point L32-1(line 32) the Hoare annotation is: true [2021-02-21 21:21:21,592 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,592 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,592 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,592 INFO L185 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (< 0 main_~scheme~0) (<= (+ main_~scheme~0 1) main_~urilen~0)) [2021-02-21 21:21:21,593 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-21 21:21:21,593 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-21 21:21:21,593 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,593 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,593 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,593 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,594 INFO L192 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: true [2021-02-21 21:21:21,594 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,594 INFO L192 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: true [2021-02-21 21:21:21,594 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,594 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,594 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,595 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,595 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,595 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,595 INFO L185 CegarLoopUtils]: 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)) [2021-02-21 21:21:21,595 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,596 INFO L185 CegarLoopUtils]: 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))) [2021-02-21 21:21:21,596 INFO L192 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: true [2021-02-21 21:21:21,596 INFO L192 CegarLoopUtils]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2021-02-21 21:21:21,596 INFO L185 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 21:21:21,596 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-02-21 21:21:21,596 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 21:21:21,596 INFO L185 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 21:21:21,596 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 21:21:21,597 INFO L185 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 21:21:21,597 INFO L185 CegarLoopUtils]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 21:21:21,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 09:21:21 BoogieIcfgContainer [2021-02-21 21:21:21,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 21:21:21,621 INFO L168 Benchmark]: Toolchain (without parser) took 10846.54 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 127.7 MB in the beginning and 111.4 MB in the end (delta: 16.3 MB). Peak memory consumption was 148.4 MB. Max. memory is 8.0 GB. [2021-02-21 21:21:21,621 INFO L168 Benchmark]: CDTParser took 1.22 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 21:21:21,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.12 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-02-21 21:21:21,624 INFO L168 Benchmark]: Boogie Preprocessor took 92.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-21 21:21:21,625 INFO L168 Benchmark]: RCFGBuilder took 737.09 ms. Allocated memory is still 151.0 MB. Free memory was 114.5 MB in the beginning and 133.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 8.0 GB. [2021-02-21 21:21:21,625 INFO L168 Benchmark]: TraceAbstraction took 9655.48 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 133.3 MB in the beginning and 111.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 152.5 MB. Max. memory is 8.0 GB. [2021-02-21 21:21:21,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 342.12 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 92.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 737.09 ms. Allocated memory is still 151.0 MB. Free memory was 114.5 MB in the beginning and 133.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9655.48 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 133.3 MB in the beginning and 111.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 152.5 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 - 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: 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: 6.0s, OverallIterations: 6, TraceHistogramMax: 14, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 533 SDtfs, 690 SDslu, 528 SDs, 0 SdLazy, 1730 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 450 PreInvPairs, 579 NumberOfFragments, 1521 HoareAnnotationTreeSize, 450 FomulaSimplifications, 1648 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 100 FomulaSimplificationsInter, 2776 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...