/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:09:26,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:09:26,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:09:26,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:09:26,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:09:26,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:09:26,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:09:26,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:09:26,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:09:26,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:09:26,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:09:26,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:09:26,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:09:26,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:09:26,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:09:26,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:09:26,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:09:26,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:09:26,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:09:26,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:09:26,747 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:09:26,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:09:26,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:09:26,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:09:26,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:09:26,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:09:26,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:09:26,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:09:26,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:09:26,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:09:26,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:09:26,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:09:26,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:09:26,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:09:26,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:09:26,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:09:26,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:09:26,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:09:26,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:09:26,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:09:26,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:09:26,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:09:26,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:09:26,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:09:26,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:09:26,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:09:26,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:09:26,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:09:26,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:09:26,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:09:26,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:09:26,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:09:26,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:09:26,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:09:26,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:09:26,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:09:26,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:09:26,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:09:26,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:09:26,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:09:26,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:09:26,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:26,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:09:26,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:09:26,791 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:09:26,791 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:09:26,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:09:26,791 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:09:26,792 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:09:27,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:09:27,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:09:27,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:09:27,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:09:27,065 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:09:27,066 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 [2022-04-28 03:09:27,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b48475c/2aeaaa9760ee4ef1be8f54ea31668ea9/FLAG62b091c39 [2022-04-28 03:09:27,526 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:09:27,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-28 03:09:27,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b48475c/2aeaaa9760ee4ef1be8f54ea31668ea9/FLAG62b091c39 [2022-04-28 03:09:27,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b48475c/2aeaaa9760ee4ef1be8f54ea31668ea9 [2022-04-28 03:09:27,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:09:27,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:09:27,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:27,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:09:27,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:09:27,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:27" (1/1) ... [2022-04-28 03:09:27,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c404f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:27, skipping insertion in model container [2022-04-28 03:09:27,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:27" (1/1) ... [2022-04-28 03:09:27,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:09:27,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:09:28,124 WARN L230 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] [2022-04-28 03:09:28,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:28,154 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:09:28,165 WARN L230 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] [2022-04-28 03:09:28,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:28,188 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:09:28,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28 WrapperNode [2022-04-28 03:09:28,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:28,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:09:28,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:09:28,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:09:28,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:09:28,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:09:28,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:09:28,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:09:28,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (1/1) ... [2022-04-28 03:09:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:28,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:28,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:09:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:09:28,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:09:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:09:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:09:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:09:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:09:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:09:28,299 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:09:28,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:09:28,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:09:28,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:09:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:09:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:09:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:09:28,356 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:09:28,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:09:28,592 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:09:28,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:09:28,599 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:09:28,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:28 BoogieIcfgContainer [2022-04-28 03:09:28,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:09:28,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:09:28,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:09:28,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:09:28,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:09:27" (1/3) ... [2022-04-28 03:09:28,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41795d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:28, skipping insertion in model container [2022-04-28 03:09:28,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:28" (2/3) ... [2022-04-28 03:09:28,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41795d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:28, skipping insertion in model container [2022-04-28 03:09:28,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:28" (3/3) ... [2022-04-28 03:09:28,607 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-04-28 03:09:28,620 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:09:28,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:09:28,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:09:28,676 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a952e79, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a48eae6 [2022-04-28 03:09:28,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:09:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 03:09:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:09:28,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:28,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:28,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2022-04-28 03:09:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932910270] [2022-04-28 03:09:28,727 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 2 times [2022-04-28 03:09:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:28,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350816907] [2022-04-28 03:09:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:29,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {57#true} is VALID [2022-04-28 03:09:29,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-28 03:09:29,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-28 03:09:29,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:29,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {57#true} is VALID [2022-04-28 03:09:29,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-28 03:09:29,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-28 03:09:29,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret12 := main(); {57#true} is VALID [2022-04-28 03:09:29,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {57#true} is VALID [2022-04-28 03:09:29,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {57#true} is VALID [2022-04-28 03:09:29,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {57#true} is VALID [2022-04-28 03:09:29,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {57#true} is VALID [2022-04-28 03:09:29,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#true} assume ~urilen~0 > 0; {57#true} is VALID [2022-04-28 03:09:29,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#true} assume ~tokenlen~0 > 0; {57#true} is VALID [2022-04-28 03:09:29,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#true} assume ~scheme~0 >= 0; {57#true} is VALID [2022-04-28 03:09:29,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {62#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2022-04-28 03:09:29,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {62#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {63#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:29,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {64#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:29,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {58#false} is VALID [2022-04-28 03:09:29,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-28 03:09:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:29,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:29,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350816907] [2022-04-28 03:09:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350816907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:29,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:29,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:29,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:29,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932910270] [2022-04-28 03:09:29,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932910270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:29,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:29,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418730793] [2022-04-28 03:09:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:29,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:29,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:29,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:29,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:29,089 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,164 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-28 03:09:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:30,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-28 03:09:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-28 03:09:30,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-28 03:09:30,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:30,433 INFO L225 Difference]: With dead ends: 112 [2022-04-28 03:09:30,433 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 03:09:30,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:09:30,439 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:30,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:09:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 03:09:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-28 03:09:30,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:30,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:30,487 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:30,487 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,502 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-28 03:09:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-28 03:09:30,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:30,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-28 03:09:30,507 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-28 03:09:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,516 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-28 03:09:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-28 03:09:30,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:30,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:30,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:30,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-28 03:09:30,526 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-28 03:09:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:30,526 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-28 03:09:30,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:30,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 80 transitions. [2022-04-28 03:09:30,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-28 03:09:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:09:30,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:30,628 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:30,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:09:30,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2022-04-28 03:09:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:30,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983873445] [2022-04-28 03:09:30,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 2 times [2022-04-28 03:09:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:30,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641527511] [2022-04-28 03:09:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:30,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {542#true} is VALID [2022-04-28 03:09:30,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-28 03:09:30,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #184#return; {542#true} is VALID [2022-04-28 03:09:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 03:09:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:30,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#true} ~cond := #in~cond; {542#true} is VALID [2022-04-28 03:09:30,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume !(0 == ~cond); {542#true} is VALID [2022-04-28 03:09:30,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-28 03:09:30,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {548#(<= 1 main_~cp~0)} #148#return; {548#(<= 1 main_~cp~0)} is VALID [2022-04-28 03:09:30,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:30,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {542#true} is VALID [2022-04-28 03:09:30,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-28 03:09:30,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #184#return; {542#true} is VALID [2022-04-28 03:09:30,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret12 := main(); {542#true} is VALID [2022-04-28 03:09:30,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {542#true} is VALID [2022-04-28 03:09:30,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {542#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {542#true} is VALID [2022-04-28 03:09:30,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {542#true} is VALID [2022-04-28 03:09:30,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {542#true} is VALID [2022-04-28 03:09:30,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#true} assume ~urilen~0 > 0; {542#true} is VALID [2022-04-28 03:09:30,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#true} assume ~tokenlen~0 > 0; {542#true} is VALID [2022-04-28 03:09:30,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#true} assume ~scheme~0 >= 0; {547#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-28 03:09:30,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {548#(<= 1 main_~cp~0)} is VALID [2022-04-28 03:09:30,779 INFO L272 TraceCheckUtils]: 13: Hoare triple {548#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {542#true} is VALID [2022-04-28 03:09:30,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#true} ~cond := #in~cond; {542#true} is VALID [2022-04-28 03:09:30,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#true} assume !(0 == ~cond); {542#true} is VALID [2022-04-28 03:09:30,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-28 03:09:30,780 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {542#true} {548#(<= 1 main_~cp~0)} #148#return; {548#(<= 1 main_~cp~0)} is VALID [2022-04-28 03:09:30,781 INFO L272 TraceCheckUtils]: 18: Hoare triple {548#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:30,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {553#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {554#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:30,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {543#false} is VALID [2022-04-28 03:09:30,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-28 03:09:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641527511] [2022-04-28 03:09:30,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641527511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:30,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:30,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:30,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983873445] [2022-04-28 03:09:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983873445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157702477] [2022-04-28 03:09:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:30,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 03:09:30,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:30,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:30,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:30,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:30,806 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,604 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-28 03:09:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 03:09:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-28 03:09:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-28 03:09:31,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-28 03:09:31,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:31,700 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:09:31,701 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:09:31,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:09:31,706 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:31,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 66 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:09:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:09:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:09:31,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:31,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:31,779 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:31,781 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,788 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-28 03:09:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-28 03:09:31,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-28 03:09:31,795 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-28 03:09:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,800 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-28 03:09:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-28 03:09:31,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:31,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-28 03:09:31,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-28 03:09:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:31,809 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-28 03:09:31,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:31,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 83 transitions. [2022-04-28 03:09:31,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-28 03:09:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:09:31,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:31,901 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:31,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:09:31,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2022-04-28 03:09:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:31,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591141053] [2022-04-28 03:09:31,903 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 2 times [2022-04-28 03:09:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:31,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194034360] [2022-04-28 03:09:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {938#true} is VALID [2022-04-28 03:09:32,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {938#true} {938#true} #184#return; {938#true} is VALID [2022-04-28 03:09:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 03:09:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #148#return; {938#true} is VALID [2022-04-28 03:09:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:09:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #150#return; {938#true} is VALID [2022-04-28 03:09:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 03:09:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #152#return; {938#true} is VALID [2022-04-28 03:09:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:09:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #154#return; {938#true} is VALID [2022-04-28 03:09:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:09:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-28 03:09:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 03:09:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-28 03:09:32,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {938#true} call ULTIMATE.init(); {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:32,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {938#true} is VALID [2022-04-28 03:09:32,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #184#return; {938#true} is VALID [2022-04-28 03:09:32,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {938#true} call #t~ret12 := main(); {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {938#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {938#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {938#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {938#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {938#true} assume ~urilen~0 > 0; {938#true} is VALID [2022-04-28 03:09:32,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#true} assume ~tokenlen~0 > 0; {938#true} is VALID [2022-04-28 03:09:32,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#true} assume ~scheme~0 >= 0; {938#true} is VALID [2022-04-28 03:09:32,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {938#true} is VALID [2022-04-28 03:09:32,046 INFO L272 TraceCheckUtils]: 13: Hoare triple {938#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,047 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {938#true} {938#true} #148#return; {938#true} is VALID [2022-04-28 03:09:32,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {938#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,048 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {938#true} {938#true} #150#return; {938#true} is VALID [2022-04-28 03:09:32,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {938#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {938#true} is VALID [2022-04-28 03:09:32,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {938#true} assume 0 != #t~nondet4;havoc #t~nondet4; {938#true} is VALID [2022-04-28 03:09:32,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {938#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,049 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {938#true} {938#true} #152#return; {938#true} is VALID [2022-04-28 03:09:32,049 INFO L272 TraceCheckUtils]: 30: Hoare triple {938#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,050 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {938#true} {938#true} #154#return; {938#true} is VALID [2022-04-28 03:09:32,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {938#true} assume !(~cp~0 != ~urilen~0 - 1); {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-28 03:09:32,050 INFO L272 TraceCheckUtils]: 36: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,052 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-28 03:09:32,052 INFO L272 TraceCheckUtils]: 41: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {938#true} is VALID [2022-04-28 03:09:32,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-28 03:09:32,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-28 03:09:32,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-28 03:09:32,053 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-28 03:09:32,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} assume !(~cp~0 == ~urilen~0 - 1); {939#false} is VALID [2022-04-28 03:09:32,053 INFO L272 TraceCheckUtils]: 47: Hoare triple {939#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {939#false} is VALID [2022-04-28 03:09:32,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {939#false} ~cond := #in~cond; {939#false} is VALID [2022-04-28 03:09:32,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {939#false} assume 0 == ~cond; {939#false} is VALID [2022-04-28 03:09:32,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {939#false} assume !false; {939#false} is VALID [2022-04-28 03:09:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 03:09:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194034360] [2022-04-28 03:09:32,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194034360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:32,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:32,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:32,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591141053] [2022-04-28 03:09:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591141053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:32,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058200677] [2022-04-28 03:09:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-28 03:09:32,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:32,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 03:09:32,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:32,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:09:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:09:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:09:32,085 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 03:09:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,408 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-28 03:09:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:09:32,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-28 03:09:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 03:09:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 03:09:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 03:09:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 03:09:32,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-28 03:09:32,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:32,525 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:09:32,525 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:09:32,525 INFO L412 NwaCegarLoop]: 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 [2022-04-28 03:09:32,526 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:32,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 58 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:09:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:09:32,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:32,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:32,577 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:32,577 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,580 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-28 03:09:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-28 03:09:32,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:32,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:32,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-28 03:09:32,582 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-28 03:09:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,585 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-28 03:09:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-28 03:09:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:32,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:32,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:32,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-28 03:09:32,589 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-28 03:09:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:32,589 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-28 03:09:32,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 03:09:32,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 81 transitions. [2022-04-28 03:09:32,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-28 03:09:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:09:32,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:32,677 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:09:32,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2022-04-28 03:09:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:32,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252636481] [2022-04-28 03:09:32,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 2 times [2022-04-28 03:09:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:32,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905506073] [2022-04-28 03:09:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1397#true} is VALID [2022-04-28 03:09:32,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1397#true} {1397#true} #184#return; {1397#true} is VALID [2022-04-28 03:09:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 03:09:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #148#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:09:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #150#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 03:09:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #152#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:09:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #154#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 03:09:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:09:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1397#true} call ULTIMATE.init(); {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:32,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1397#true} #184#return; {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1397#true} call #t~ret12 := main(); {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1397#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1397#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1397#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1397#true} is VALID [2022-04-28 03:09:32,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {1397#true} assume ~urilen~0 > 0; {1397#true} is VALID [2022-04-28 03:09:32,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1397#true} assume ~tokenlen~0 > 0; {1397#true} is VALID [2022-04-28 03:09:32,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1397#true} assume ~scheme~0 >= 0; {1397#true} is VALID [2022-04-28 03:09:32,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1397#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,913 INFO L272 TraceCheckUtils]: 13: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,914 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #148#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,915 INFO L272 TraceCheckUtils]: 18: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,917 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #150#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet4;havoc #t~nondet4; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,920 INFO L272 TraceCheckUtils]: 25: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,923 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #152#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,924 INFO L272 TraceCheckUtils]: 30: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,924 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #154#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-28 03:09:32,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume 0 != #t~nondet5;havoc #t~nondet5; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,926 INFO L272 TraceCheckUtils]: 37: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,927 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,927 INFO L272 TraceCheckUtils]: 42: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1397#true} is VALID [2022-04-28 03:09:32,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-28 03:09:32,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-28 03:09:32,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-28 03:09:32,927 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume !(~cp~0 == ~urilen~0 - 1); {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-28 03:09:32,929 INFO L272 TraceCheckUtils]: 48: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:32,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {1428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:32,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {1429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1398#false} is VALID [2022-04-28 03:09:32,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {1398#false} assume !false; {1398#false} is VALID [2022-04-28 03:09:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 03:09:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:32,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905506073] [2022-04-28 03:09:32,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905506073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:32,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:32,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252636481] [2022-04-28 03:09:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252636481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:32,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525838347] [2022-04-28 03:09:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-28 03:09:32,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:32,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 03:09:32,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:32,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:32,962 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 03:09:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,709 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-28 03:09:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-28 03:09:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 03:09:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-28 03:09:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 03:09:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-28 03:09:33,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-28 03:09:33,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:33,817 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:09:33,817 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:09:33,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:09:33,819 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:33,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 64 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:09:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:09:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-28 03:09:33,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:33,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:33,888 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:33,888 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,891 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-28 03:09:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-28 03:09:33,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:33,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:33,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-28 03:09:33,892 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-28 03:09:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,895 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-28 03:09:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-28 03:09:33,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:33,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:33,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:33,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-28 03:09:33,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-28 03:09:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:33,899 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-28 03:09:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 03:09:33,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 84 transitions. [2022-04-28 03:09:33,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-28 03:09:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 03:09:33,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:33,990 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:33,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:09:33,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2022-04-28 03:09:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:33,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252451143] [2022-04-28 03:09:33,991 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 2 times [2022-04-28 03:09:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:33,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54427201] [2022-04-28 03:09:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1842#true} is VALID [2022-04-28 03:09:34,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1842#true} {1842#true} #184#return; {1842#true} is VALID [2022-04-28 03:09:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 03:09:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #148#return; {1842#true} is VALID [2022-04-28 03:09:34,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:09:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #150#return; {1842#true} is VALID [2022-04-28 03:09:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 03:09:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #152#return; {1842#true} is VALID [2022-04-28 03:09:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:09:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #154#return; {1842#true} is VALID [2022-04-28 03:09:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 03:09:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #160#return; {1842#true} is VALID [2022-04-28 03:09:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:09:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #162#return; {1842#true} is VALID [2022-04-28 03:09:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:09:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #164#return; {1842#true} is VALID [2022-04-28 03:09:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:09:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #166#return; {1842#true} is VALID [2022-04-28 03:09:34,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:09:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #168#return; {1842#true} is VALID [2022-04-28 03:09:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:09:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #170#return; {1842#true} is VALID [2022-04-28 03:09:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-28 03:09:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:09:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:34,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #184#return; {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret12 := main(); {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {1842#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {1842#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1842#true} is VALID [2022-04-28 03:09:34,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {1842#true} assume ~urilen~0 > 0; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {1842#true} assume ~tokenlen~0 > 0; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {1842#true} assume ~scheme~0 >= 0; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1842#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L272 TraceCheckUtils]: 13: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,136 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1842#true} {1842#true} #148#return; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L272 TraceCheckUtils]: 18: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1842#true} {1842#true} #150#return; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {1842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {1842#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L272 TraceCheckUtils]: 25: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1842#true} {1842#true} #152#return; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L272 TraceCheckUtils]: 30: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1842#true} {1842#true} #154#return; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {1842#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1842#true} is VALID [2022-04-28 03:09:34,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {1842#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L272 TraceCheckUtils]: 37: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1842#true} {1842#true} #160#return; {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L272 TraceCheckUtils]: 42: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1842#true} {1842#true} #162#return; {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {1842#true} assume !(~cp~0 == ~urilen~0 - 1); {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L272 TraceCheckUtils]: 48: Hoare triple {1842#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,140 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1842#true} {1842#true} #164#return; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L272 TraceCheckUtils]: 53: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1842#true} {1842#true} #166#return; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {1842#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {1842#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L272 TraceCheckUtils]: 60: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,141 INFO L290 TraceCheckUtils]: 61: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1842#true} {1842#true} #168#return; {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L272 TraceCheckUtils]: 65: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,142 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1842#true} {1842#true} #170#return; {1842#true} is VALID [2022-04-28 03:09:34,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {1842#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,143 INFO L272 TraceCheckUtils]: 71: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,144 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,144 INFO L272 TraceCheckUtils]: 76: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-28 03:09:34,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-28 03:09:34,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-28 03:09:34,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-28 03:09:34,145 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,146 INFO L290 TraceCheckUtils]: 82: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {1896#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-28 03:09:34,147 INFO L272 TraceCheckUtils]: 83: Hoare triple {1896#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1897#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:34,147 INFO L290 TraceCheckUtils]: 84: Hoare triple {1897#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1898#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:34,147 INFO L290 TraceCheckUtils]: 85: Hoare triple {1898#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1843#false} is VALID [2022-04-28 03:09:34,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-04-28 03:09:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 03:09:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54427201] [2022-04-28 03:09:34,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54427201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:34,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:34,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:34,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:34,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252451143] [2022-04-28 03:09:34,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252451143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:34,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:34,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200845754] [2022-04-28 03:09:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:34,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 03:09:34,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:34,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 03:09:34,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:34,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:34,193 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 03:09:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:34,939 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-28 03:09:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 03:09:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 03:09:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-28 03:09:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 03:09:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-28 03:09:34,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-28 03:09:35,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,043 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:09:35,043 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:09:35,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:09:35,044 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:35,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 72 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:09:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:09:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-28 03:09:35,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:35,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:35,128 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:35,128 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,131 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-28 03:09:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-28 03:09:35,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:35,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:35,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-28 03:09:35,132 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-28 03:09:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,136 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-28 03:09:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-28 03:09:35,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:35,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:35,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:35,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 03:09:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-28 03:09:35,140 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-28 03:09:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-28 03:09:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 03:09:35,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 87 transitions. [2022-04-28 03:09:35,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-28 03:09:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 03:09:35,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:35,253 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:35,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:09:35,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2022-04-28 03:09:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:35,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11632190] [2022-04-28 03:09:35,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 2 times [2022-04-28 03:09:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15220907] [2022-04-28 03:09:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2342#true} is VALID [2022-04-28 03:09:35,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2342#true} {2342#true} #184#return; {2342#true} is VALID [2022-04-28 03:09:35,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 03:09:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #148#return; {2342#true} is VALID [2022-04-28 03:09:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:09:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #150#return; {2342#true} is VALID [2022-04-28 03:09:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 03:09:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #152#return; {2342#true} is VALID [2022-04-28 03:09:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:09:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #154#return; {2342#true} is VALID [2022-04-28 03:09:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 03:09:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #160#return; {2342#true} is VALID [2022-04-28 03:09:35,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:09:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #162#return; {2342#true} is VALID [2022-04-28 03:09:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:09:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #164#return; {2342#true} is VALID [2022-04-28 03:09:35,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 03:09:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #166#return; {2342#true} is VALID [2022-04-28 03:09:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:09:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #168#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 03:09:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #170#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-28 03:09:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #172#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:09:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #174#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-28 03:09:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2396#(<= 1 main_~c~0)} #176#return; {2396#(<= 1 main_~c~0)} is VALID [2022-04-28 03:09:35,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {2342#true} call ULTIMATE.init(); {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:35,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2342#true} is VALID [2022-04-28 03:09:35,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #184#return; {2342#true} is VALID [2022-04-28 03:09:35,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {2342#true} call #t~ret12 := main(); {2342#true} is VALID [2022-04-28 03:09:35,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {2342#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {2342#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#true} assume ~urilen~0 > 0; {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {2342#true} assume ~tokenlen~0 > 0; {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#true} assume ~scheme~0 >= 0; {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2342#true} is VALID [2022-04-28 03:09:35,397 INFO L272 TraceCheckUtils]: 13: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2342#true} {2342#true} #148#return; {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L272 TraceCheckUtils]: 18: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2342#true} {2342#true} #150#return; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L272 TraceCheckUtils]: 25: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2342#true} {2342#true} #152#return; {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L272 TraceCheckUtils]: 30: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2342#true} {2342#true} #154#return; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {2342#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {2342#true} assume 0 != #t~nondet5;havoc #t~nondet5; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L272 TraceCheckUtils]: 37: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2342#true} {2342#true} #160#return; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L272 TraceCheckUtils]: 42: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2342#true} {2342#true} #162#return; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {2342#true} assume !(~cp~0 == ~urilen~0 - 1); {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L272 TraceCheckUtils]: 48: Hoare triple {2342#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2342#true} {2342#true} #164#return; {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L272 TraceCheckUtils]: 53: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2342#true} {2342#true} #166#return; {2342#true} is VALID [2022-04-28 03:09:35,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {2342#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2342#true} is VALID [2022-04-28 03:09:35,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {2342#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,403 INFO L272 TraceCheckUtils]: 60: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,404 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #168#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,404 INFO L272 TraceCheckUtils]: 65: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,404 INFO L290 TraceCheckUtils]: 66: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,404 INFO L290 TraceCheckUtils]: 67: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,404 INFO L290 TraceCheckUtils]: 68: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,404 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #170#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {2379#(= main_~c~0 0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,405 INFO L272 TraceCheckUtils]: 71: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,406 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #172#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,406 INFO L272 TraceCheckUtils]: 76: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,406 INFO L290 TraceCheckUtils]: 77: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,406 INFO L290 TraceCheckUtils]: 78: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,406 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #174#return; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,407 INFO L290 TraceCheckUtils]: 81: Hoare triple {2379#(= main_~c~0 0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2379#(= main_~c~0 0)} is VALID [2022-04-28 03:09:35,407 INFO L290 TraceCheckUtils]: 82: Hoare triple {2379#(= main_~c~0 0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {2396#(<= 1 main_~c~0)} is VALID [2022-04-28 03:09:35,407 INFO L272 TraceCheckUtils]: 83: Hoare triple {2396#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2342#true} is VALID [2022-04-28 03:09:35,407 INFO L290 TraceCheckUtils]: 84: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-28 03:09:35,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-28 03:09:35,408 INFO L290 TraceCheckUtils]: 86: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-28 03:09:35,408 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {2342#true} {2396#(<= 1 main_~c~0)} #176#return; {2396#(<= 1 main_~c~0)} is VALID [2022-04-28 03:09:35,409 INFO L272 TraceCheckUtils]: 88: Hoare triple {2396#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2401#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:35,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {2401#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2402#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:35,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {2402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2343#false} is VALID [2022-04-28 03:09:35,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {2343#false} assume !false; {2343#false} is VALID [2022-04-28 03:09:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 03:09:35,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:35,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15220907] [2022-04-28 03:09:35,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15220907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:35,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:35,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:35,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:35,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11632190] [2022-04-28 03:09:35,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11632190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:35,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:35,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197705792] [2022-04-28 03:09:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:35,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-28 03:09:35,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:35,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 03:09:35,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:35,452 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 03:09:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,221 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-28 03:09:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-28 03:09:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 03:09:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-28 03:09:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 03:09:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-28 03:09:36,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-28 03:09:36,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,318 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:09:36,318 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:09:36,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:09:36,323 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:36,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:09:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:09:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:09:36,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:36,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:36,325 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:36,325 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:36,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:09:36,326 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:09:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,326 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:36,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:36,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:09:36,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-28 03:09:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:36,326 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:09:36,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 03:09:36,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:09:36,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:36,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:09:36,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:09:36,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:09:36,950 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2022-04-28 03:09:36,950 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-28 03:09:36,951 INFO L902 garLoopResultBuilder]: At program point L36(lines 25 83) the Hoare annotation is: true [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L61(lines 61 79) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2022-04-28 03:09:36,951 INFO L895 garLoopResultBuilder]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,952 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,953 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,954 INFO L902 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-28 03:09:36,954 INFO L902 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-28 03:09:36,954 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-28 03:09:36,954 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-28 03:09:36,954 INFO L902 garLoopResultBuilder]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:09:36,955 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:09:36,955 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:09:36,955 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:09:36,955 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:09:36,956 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:09:36,958 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-28 03:09:36,960 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:09:36,963 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:09:36,963 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:09:36,967 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:09:36,967 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:09:36,968 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:09:36,968 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:09:36,968 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:09:36,999 INFO L163 areAnnotationChecker]: CFG has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:09:37,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:09:37 BoogieIcfgContainer [2022-04-28 03:09:37,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:09:37,009 INFO L158 Benchmark]: Toolchain (without parser) took 9079.08ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 123.0MB in the beginning and 169.7MB in the end (delta: -46.7MB). Peak memory consumption was 116.1MB. Max. memory is 8.0GB. [2022-04-28 03:09:37,009 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:09:37,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.52ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 146.6MB in the end (delta: -23.9MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-28 03:09:37,010 INFO L158 Benchmark]: Boogie Preprocessor took 48.53ms. Allocated memory is still 172.0MB. Free memory was 146.6MB in the beginning and 144.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:09:37,010 INFO L158 Benchmark]: RCFGBuilder took 361.72ms. Allocated memory is still 172.0MB. Free memory was 144.9MB in the beginning and 128.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-28 03:09:37,010 INFO L158 Benchmark]: TraceAbstraction took 8405.96ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 127.4MB in the beginning and 169.7MB in the end (delta: -42.3MB). Peak memory consumption was 121.0MB. Max. memory is 8.0GB. [2022-04-28 03:09:37,011 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.52ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 146.6MB in the end (delta: -23.9MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.53ms. Allocated memory is still 172.0MB. Free memory was 146.6MB in the beginning and 144.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 361.72ms. Allocated memory is still 172.0MB. Free memory was 144.9MB in the beginning and 128.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 8405.96ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 127.4MB in the beginning and 169.7MB in the end (delta: -42.3MB). Peak memory consumption was 121.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 300 mSDtfsCounter, 1338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 354 PreInvPairs, 452 NumberOfFragments, 779 HoareAnnotationTreeSize, 354 FomulaSimplifications, 38 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 54 FomulaSimplificationsInter, 397 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 03:09:37,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...