/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:45:25,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:45:25,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:45:25,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:45:25,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:45:25,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:45:25,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:45:25,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:45:25,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:45:25,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:45:25,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:45:25,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:45:25,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:45:25,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:45:25,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:45:25,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:45:25,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:45:25,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:45:25,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:45:25,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:45:25,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:45:25,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:45:25,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:45:25,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:45:25,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:45:25,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:45:25,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:45:25,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:45:25,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:45:25,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:45:25,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:45:25,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:45:25,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:45:25,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:45:25,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:45:25,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:45:25,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:45:25,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:45:25,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:45:25,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:45:25,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:45:25,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:45:25,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:45:25,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:45:25,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:45:25,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:45:25,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:45:25,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:45:25,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:45:25,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:45:25,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:45:25,676 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:45:25,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:45:25,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:45:25,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:25,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:45:25,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:45:25,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:45:25,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:45:25,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:45:25,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:45:25,871 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:45:25,872 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-27 10:45:25,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ee8e282/2645575742df45a1a5b57b3cb02ee6db/FLAGecf6a379d [2022-04-27 10:45:26,256 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:45:26,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-27 10:45:26,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ee8e282/2645575742df45a1a5b57b3cb02ee6db/FLAGecf6a379d [2022-04-27 10:45:26,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ee8e282/2645575742df45a1a5b57b3cb02ee6db [2022-04-27 10:45:26,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:45:26,280 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:45:26,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:26,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:45:26,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:45:26,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26, skipping insertion in model container [2022-04-27 10:45:26,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:45:26,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:45:26,455 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-27 10:45:26,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:26,491 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:45:26,505 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-27 10:45:26,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:26,532 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:45:26,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26 WrapperNode [2022-04-27 10:45:26,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:26,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:45:26,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:45:26,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:45:26,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:45:26,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:45:26,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:45:26,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:45:26,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (1/1) ... [2022-04-27 10:45:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:26,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:26,595 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-27 10:45:26,606 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-27 10:45:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:45:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:45:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:45:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:45:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:45:26,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:45:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:45:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:45:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:45:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:45:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:45:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:45:26,667 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:45:26,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:45:26,932 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:45:26,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:45:26,937 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:45:26,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:26 BoogieIcfgContainer [2022-04-27 10:45:26,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:45:26,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:45:26,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:45:26,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:45:26,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:45:26" (1/3) ... [2022-04-27 10:45:26,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d34a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:26, skipping insertion in model container [2022-04-27 10:45:26,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:26" (2/3) ... [2022-04-27 10:45:26,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d34a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:26, skipping insertion in model container [2022-04-27 10:45:26,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:26" (3/3) ... [2022-04-27 10:45:26,943 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-04-27 10:45:26,952 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:45:26,952 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:45:26,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:45:26,984 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@16d00de2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@231fcf37 [2022-04-27 10:45:26,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:45:26,989 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-27 10:45:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:45:26,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:26,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:26,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2022-04-27 10:45:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:27,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265489385] [2022-04-27 10:45:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:27,143 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-27 10:45:27,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-27 10:45:27,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-27 10:45:27,144 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-27 10:45:27,144 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-27 10:45:27,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-27 10:45:27,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-27 10:45:27,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret12 := main(); {57#true} is VALID [2022-04-27 10:45:27,145 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-27 10:45:27,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {57#true} is VALID [2022-04-27 10:45:27,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {57#true} is VALID [2022-04-27 10:45:27,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {57#true} is VALID [2022-04-27 10:45:27,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#true} assume ~urilen~0 > 0; {57#true} is VALID [2022-04-27 10:45:27,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#true} assume ~tokenlen~0 > 0; {57#true} is VALID [2022-04-27 10:45:27,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#true} assume ~scheme~0 >= 0; {57#true} is VALID [2022-04-27 10:45:27,147 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-27 10:45:27,147 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-27 10:45:27,148 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-27 10:45:27,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {58#false} is VALID [2022-04-27 10:45:27,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-27 10:45:27,149 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-27 10:45:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:27,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265489385] [2022-04-27 10:45:27,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265489385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:27,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:27,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731246038] [2022-04-27 10:45:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:27,155 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-27 10:45:27,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:27,158 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-27 10:45:27,172 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-27 10:45:27,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:27,187 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-27 10:45:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:27,946 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-27 10:45:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:27,946 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-27 10:45:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:27,947 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-27 10:45:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-27 10:45:27,967 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-27 10:45:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-27 10:45:27,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-27 10:45:28,148 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-27 10:45:28,163 INFO L225 Difference]: With dead ends: 112 [2022-04-27 10:45:28,163 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 10:45:28,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:45:28,171 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:28,171 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.3s Time] [2022-04-27 10:45:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 10:45:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-27 10:45:28,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:28,203 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-27 10:45:28,204 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-27 10:45:28,204 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-27 10:45:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:28,210 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 10:45:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 10:45:28,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:28,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:28,212 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-27 10:45:28,212 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-27 10:45:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:28,220 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 10:45:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 10:45:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:28,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:28,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:28,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:28,222 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-27 10:45:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-27 10:45:28,226 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-27 10:45:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:28,226 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-27 10:45:28,226 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-27 10:45:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-27 10:45:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:45:28,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:28,227 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-27 10:45:28,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:45:28,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2022-04-27 10:45:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:28,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30679101] [2022-04-27 10:45:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:28,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(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); {458#true} is VALID [2022-04-27 10:45:28,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:45:28,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #184#return; {458#true} is VALID [2022-04-27 10:45:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:45:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:28,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 10:45:28,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 10:45:28,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:45:28,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} #148#return; {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 10:45:28,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:28,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(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); {458#true} is VALID [2022-04-27 10:45:28,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:45:28,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #184#return; {458#true} is VALID [2022-04-27 10:45:28,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret12 := main(); {458#true} is VALID [2022-04-27 10:45:28,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#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; {458#true} is VALID [2022-04-27 10:45:28,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {458#true} is VALID [2022-04-27 10:45:28,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {458#true} is VALID [2022-04-27 10:45:28,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {458#true} is VALID [2022-04-27 10:45:28,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} assume ~urilen~0 > 0; {458#true} is VALID [2022-04-27 10:45:28,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#true} assume ~tokenlen~0 > 0; {458#true} is VALID [2022-04-27 10:45:28,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} assume ~scheme~0 >= 0; {463#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-27 10:45:28,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 10:45:28,307 INFO L272 TraceCheckUtils]: 13: Hoare triple {464#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {458#true} is VALID [2022-04-27 10:45:28,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 10:45:28,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 10:45:28,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:45:28,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} #148#return; {464#(<= 1 main_~cp~0)} is VALID [2022-04-27 10:45:28,309 INFO L272 TraceCheckUtils]: 18: Hoare triple {464#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:28,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:28,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2022-04-27 10:45:28,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-27 10:45:28,313 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-27 10:45:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:28,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30679101] [2022-04-27 10:45:28,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30679101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:28,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:28,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694000943] [2022-04-27 10:45:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:28,316 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-27 10:45:28,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:28,317 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-27 10:45:28,333 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-27 10:45:28,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:28,336 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-27 10:45:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,002 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-27 10:45:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:29,002 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-27 10:45:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:29,002 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-27 10:45:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 10:45:29,004 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-27 10:45:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 10:45:29,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-27 10:45:29,067 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-27 10:45:29,069 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:45:29,069 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 10:45:29,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:45:29,070 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-27 10:45:29,070 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-27 10:45:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 10:45:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 10:45:29,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:29,099 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-27 10:45:29,099 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-27 10:45:29,100 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-27 10:45:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,102 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 10:45:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 10:45:29,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,104 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-27 10:45:29,104 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-27 10:45:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,106 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 10:45:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 10:45:29,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:29,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:29,108 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-27 10:45:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-27 10:45:29,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-27 10:45:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:29,110 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-27 10:45:29,110 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-27 10:45:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 10:45:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 10:45:29,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:29,111 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-27 10:45:29,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:45:29,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2022-04-27 10:45:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:29,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971958601] [2022-04-27 10:45:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(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); {790#true} is VALID [2022-04-27 10:45:29,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #184#return; {790#true} is VALID [2022-04-27 10:45:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:45:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #148#return; {790#true} is VALID [2022-04-27 10:45:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:45:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #150#return; {790#true} is VALID [2022-04-27 10:45:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:45:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #152#return; {790#true} is VALID [2022-04-27 10:45:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:45:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #154#return; {790#true} is VALID [2022-04-27 10:45:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 10:45:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 10:45:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 10:45:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 10:45:29,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:29,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(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); {790#true} is VALID [2022-04-27 10:45:29,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #184#return; {790#true} is VALID [2022-04-27 10:45:29,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret12 := main(); {790#true} is VALID [2022-04-27 10:45:29,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#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; {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume ~urilen~0 > 0; {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {790#true} assume ~tokenlen~0 > 0; {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {790#true} assume ~scheme~0 >= 0; {790#true} is VALID [2022-04-27 10:45:29,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {790#true} is VALID [2022-04-27 10:45:29,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {790#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,199 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {790#true} {790#true} #148#return; {790#true} is VALID [2022-04-27 10:45:29,199 INFO L272 TraceCheckUtils]: 18: Hoare triple {790#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,199 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {790#true} {790#true} #150#return; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {790#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {790#true} assume 0 != #t~nondet4;havoc #t~nondet4; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L272 TraceCheckUtils]: 25: Hoare triple {790#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {790#true} {790#true} #152#return; {790#true} is VALID [2022-04-27 10:45:29,200 INFO L272 TraceCheckUtils]: 30: Hoare triple {790#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,201 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {790#true} {790#true} #154#return; {790#true} is VALID [2022-04-27 10:45:29,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {790#true} assume !(~cp~0 != ~urilen~0 - 1); {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 10:45:29,201 INFO L272 TraceCheckUtils]: 36: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,202 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 10:45:29,202 INFO L272 TraceCheckUtils]: 41: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {790#true} is VALID [2022-04-27 10:45:29,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-27 10:45:29,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-27 10:45:29,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-27 10:45:29,203 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 10:45:29,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} assume !(~cp~0 == ~urilen~0 - 1); {791#false} is VALID [2022-04-27 10:45:29,204 INFO L272 TraceCheckUtils]: 47: Hoare triple {791#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {791#false} is VALID [2022-04-27 10:45:29,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {791#false} ~cond := #in~cond; {791#false} is VALID [2022-04-27 10:45:29,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {791#false} assume 0 == ~cond; {791#false} is VALID [2022-04-27 10:45:29,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-27 10:45:29,204 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-27 10:45:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:29,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971958601] [2022-04-27 10:45:29,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971958601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:29,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:29,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:45:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599534198] [2022-04-27 10:45:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:29,206 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-27 10:45:29,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:29,206 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-27 10:45:29,224 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-27 10:45:29,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:45:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:29,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:45:29,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:45:29,225 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-27 10:45:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,444 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-27 10:45:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:45:29,444 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-27 10:45:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:29,444 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-27 10:45:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 10:45:29,446 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-27 10:45:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 10:45:29,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-27 10:45:29,537 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-27 10:45:29,539 INFO L225 Difference]: With dead ends: 90 [2022-04-27 10:45:29,539 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 10:45:29,539 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-27 10:45:29,540 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-27 10:45:29,541 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-27 10:45:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 10:45:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 10:45:29,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:29,569 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-27 10:45:29,570 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-27 10:45:29,570 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-27 10:45:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,572 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 10:45:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 10:45:29,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,573 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-27 10:45:29,574 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-27 10:45:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:29,576 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 10:45:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 10:45:29,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:29,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:29,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:29,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:29,577 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-27 10:45:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-27 10:45:29,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-27 10:45:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:29,579 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-27 10:45:29,579 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-27 10:45:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 10:45:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 10:45:29,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:29,580 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-27 10:45:29,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:45:29,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2022-04-27 10:45:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:29,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645378814] [2022-04-27 10:45:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(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); {1173#true} is VALID [2022-04-27 10:45:29,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #184#return; {1173#true} is VALID [2022-04-27 10:45:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:45:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #148#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:45:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #150#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:45:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #152#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:45:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #154#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 10:45:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:29,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(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); {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #184#return; {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret12 := main(); {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#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; {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1173#true} is VALID [2022-04-27 10:45:29,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1173#true} is VALID [2022-04-27 10:45:29,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} assume ~urilen~0 > 0; {1173#true} is VALID [2022-04-27 10:45:29,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1173#true} assume ~tokenlen~0 > 0; {1173#true} is VALID [2022-04-27 10:45:29,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {1173#true} assume ~scheme~0 >= 0; {1173#true} is VALID [2022-04-27 10:45:29,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,694 INFO L272 TraceCheckUtils]: 13: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1173#true} is VALID [2022-04-27 10:45:29,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #148#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,696 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #150#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet4;havoc #t~nondet4; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,697 INFO L272 TraceCheckUtils]: 25: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1173#true} is VALID [2022-04-27 10:45:29,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,697 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #152#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,697 INFO L272 TraceCheckUtils]: 30: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1173#true} is VALID [2022-04-27 10:45:29,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,698 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} #154#return; {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 10:45:29,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume 0 != #t~nondet5;havoc #t~nondet5; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,699 INFO L272 TraceCheckUtils]: 37: Hoare triple {1195#(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)); {1173#true} is VALID [2022-04-27 10:45:29,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,700 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,700 INFO L272 TraceCheckUtils]: 42: Hoare triple {1195#(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)); {1173#true} is VALID [2022-04-27 10:45:29,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {1173#true} ~cond := #in~cond; {1173#true} is VALID [2022-04-27 10:45:29,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {1173#true} assume !(0 == ~cond); {1173#true} is VALID [2022-04-27 10:45:29,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 10:45:29,700 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume !(~cp~0 == ~urilen~0 - 1); {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 10:45:29,701 INFO L272 TraceCheckUtils]: 48: Hoare triple {1195#(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)); {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:29,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1205#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:29,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {1205#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 10:45:29,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 10:45:29,702 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-27 10:45:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:29,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645378814] [2022-04-27 10:45:29,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645378814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:29,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:29,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:29,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818608621] [2022-04-27 10:45:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:29,703 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-27 10:45:29,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:29,704 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-27 10:45:29,722 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-27 10:45:29,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:29,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:29,724 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-27 10:45:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:30,245 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-27 10:45:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:30,245 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-27 10:45:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:30,246 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-27 10:45:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 10:45:30,247 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-27 10:45:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-27 10:45:30,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-27 10:45:30,306 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-27 10:45:30,307 INFO L225 Difference]: With dead ends: 68 [2022-04-27 10:45:30,307 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 10:45:30,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:45:30,308 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:30,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 10:45:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-27 10:45:30,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:30,344 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-27 10:45:30,344 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-27 10:45:30,344 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-27 10:45:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:30,347 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 10:45:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 10:45:30,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:30,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:30,347 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-27 10:45:30,348 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-27 10:45:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:30,350 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 10:45:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 10:45:30,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:30,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:30,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:30,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:30,350 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-27 10:45:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-27 10:45:30,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-27 10:45:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:30,353 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-27 10:45:30,353 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-27 10:45:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-27 10:45:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 10:45:30,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:30,354 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-27 10:45:30,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:45:30,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2022-04-27 10:45:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:30,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46577529] [2022-04-27 10:45:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1605#(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); {1548#true} is VALID [2022-04-27 10:45:30,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1548#true} {1548#true} #184#return; {1548#true} is VALID [2022-04-27 10:45:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:45:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #148#return; {1548#true} is VALID [2022-04-27 10:45:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:45:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #150#return; {1548#true} is VALID [2022-04-27 10:45:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:45:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #152#return; {1548#true} is VALID [2022-04-27 10:45:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:45:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #154#return; {1548#true} is VALID [2022-04-27 10:45:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #160#return; {1548#true} is VALID [2022-04-27 10:45:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 10:45:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #162#return; {1548#true} is VALID [2022-04-27 10:45:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:45:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #164#return; {1548#true} is VALID [2022-04-27 10:45:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 10:45:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #166#return; {1548#true} is VALID [2022-04-27 10:45:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:45:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #168#return; {1548#true} is VALID [2022-04-27 10:45:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:45:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #170#return; {1548#true} is VALID [2022-04-27 10:45:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 10:45:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 10:45:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:30,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1548#true} call ULTIMATE.init(); {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#(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); {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} #184#return; {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {1548#true} call #t~ret12 := main(); {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#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; {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1548#true} is VALID [2022-04-27 10:45:30,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} assume ~urilen~0 > 0; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} assume ~tokenlen~0 > 0; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#true} assume ~scheme~0 >= 0; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L272 TraceCheckUtils]: 13: Hoare triple {1548#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1548#true} {1548#true} #148#return; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L272 TraceCheckUtils]: 18: Hoare triple {1548#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1548#true} {1548#true} #150#return; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L272 TraceCheckUtils]: 25: Hoare triple {1548#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1548#true} {1548#true} #152#return; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L272 TraceCheckUtils]: 30: Hoare triple {1548#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1548#true} {1548#true} #154#return; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {1548#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {1548#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L272 TraceCheckUtils]: 37: Hoare triple {1548#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1548#true} {1548#true} #160#return; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L272 TraceCheckUtils]: 42: Hoare triple {1548#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1548#true} {1548#true} #162#return; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {1548#true} assume !(~cp~0 == ~urilen~0 - 1); {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L272 TraceCheckUtils]: 48: Hoare triple {1548#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1548#true} {1548#true} #164#return; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L272 TraceCheckUtils]: 53: Hoare triple {1548#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,497 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1548#true} {1548#true} #166#return; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {1548#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; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {1548#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L272 TraceCheckUtils]: 60: Hoare triple {1548#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1548#true} {1548#true} #168#return; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L272 TraceCheckUtils]: 65: Hoare triple {1548#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 67: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,498 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1548#true} {1548#true} #170#return; {1548#true} is VALID [2022-04-27 10:45:30,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {1548#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,499 INFO L272 TraceCheckUtils]: 71: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,500 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,500 INFO L272 TraceCheckUtils]: 76: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1548#true} is VALID [2022-04-27 10:45:30,500 INFO L290 TraceCheckUtils]: 77: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-04-27 10:45:30,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-04-27 10:45:30,500 INFO L290 TraceCheckUtils]: 79: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-04-27 10:45:30,500 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {1593#(<= (+ 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; {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-27 10:45:30,502 INFO L272 TraceCheckUtils]: 83: Hoare triple {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:30,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1604#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:30,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {1604#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1549#false} is VALID [2022-04-27 10:45:30,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {1549#false} assume !false; {1549#false} is VALID [2022-04-27 10:45:30,503 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-27 10:45:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:30,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46577529] [2022-04-27 10:45:30,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46577529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:30,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328241129] [2022-04-27 10:45:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:30,504 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-27 10:45:30,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:30,504 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-27 10:45:30,532 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-27 10:45:30,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:30,533 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-27 10:45:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,014 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-27 10:45:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:31,014 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-27 10:45:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:31,014 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-27 10:45:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-27 10:45:31,016 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-27 10:45:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-27 10:45:31,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-27 10:45:31,073 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-27 10:45:31,074 INFO L225 Difference]: With dead ends: 74 [2022-04-27 10:45:31,074 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 10:45:31,075 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-27 10:45:31,075 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:31,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 67 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 10:45:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-27 10:45:31,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:31,117 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-27 10:45:31,117 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-27 10:45:31,117 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-27 10:45:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,119 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 10:45:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 10:45:31,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:31,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:31,120 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-27 10:45:31,120 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-27 10:45:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,122 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 10:45:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 10:45:31,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:31,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:31,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:31,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:31,123 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-27 10:45:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-27 10:45:31,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-27 10:45:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:31,125 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-27 10:45:31,125 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-27 10:45:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-27 10:45:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 10:45:31,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:31,126 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-27 10:45:31,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:45:31,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2022-04-27 10:45:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:31,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136849213] [2022-04-27 10:45:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2032#(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); {1971#true} is VALID [2022-04-27 10:45:31,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1971#true} {1971#true} #184#return; {1971#true} is VALID [2022-04-27 10:45:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:45:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #148#return; {1971#true} is VALID [2022-04-27 10:45:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 10:45:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #150#return; {1971#true} is VALID [2022-04-27 10:45:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:45:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #152#return; {1971#true} is VALID [2022-04-27 10:45:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 10:45:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #154#return; {1971#true} is VALID [2022-04-27 10:45:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:45:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #160#return; {1971#true} is VALID [2022-04-27 10:45:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 10:45:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #162#return; {1971#true} is VALID [2022-04-27 10:45:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 10:45:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #164#return; {1971#true} is VALID [2022-04-27 10:45:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 10:45:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #166#return; {1971#true} is VALID [2022-04-27 10:45:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 10:45:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #168#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:45:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #170#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 10:45:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #172#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 10:45:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #174#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-27 10:45:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:31,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} #176#return; {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 10:45:31,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} call ULTIMATE.init(); {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:45:31,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#(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); {1971#true} is VALID [2022-04-27 10:45:31,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #184#return; {1971#true} is VALID [2022-04-27 10:45:31,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} call #t~ret12 := main(); {1971#true} is VALID [2022-04-27 10:45:31,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#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; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#true} assume ~urilen~0 > 0; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1971#true} assume ~tokenlen~0 > 0; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1971#true} assume ~scheme~0 >= 0; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1971#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {1971#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1971#true} {1971#true} #148#return; {1971#true} is VALID [2022-04-27 10:45:31,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {1971#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1971#true} {1971#true} #150#return; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {1971#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {1971#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L272 TraceCheckUtils]: 25: Hoare triple {1971#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1971#true} {1971#true} #152#return; {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L272 TraceCheckUtils]: 30: Hoare triple {1971#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1971#true} {1971#true} #154#return; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {1971#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {1971#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L272 TraceCheckUtils]: 37: Hoare triple {1971#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1971#true} {1971#true} #160#return; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L272 TraceCheckUtils]: 42: Hoare triple {1971#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1971#true} {1971#true} #162#return; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {1971#true} assume !(~cp~0 == ~urilen~0 - 1); {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L272 TraceCheckUtils]: 48: Hoare triple {1971#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1971#true} {1971#true} #164#return; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L272 TraceCheckUtils]: 53: Hoare triple {1971#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 55: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1971#true} {1971#true} #166#return; {1971#true} is VALID [2022-04-27 10:45:31,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {1971#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; {1971#true} is VALID [2022-04-27 10:45:31,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {1971#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,275 INFO L272 TraceCheckUtils]: 60: Hoare triple {2008#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,275 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #168#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,276 INFO L272 TraceCheckUtils]: 65: Hoare triple {2008#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,276 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #170#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#(= main_~c~0 0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,276 INFO L272 TraceCheckUtils]: 71: Hoare triple {2008#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #172#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,277 INFO L272 TraceCheckUtils]: 76: Hoare triple {2008#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 78: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,277 INFO L290 TraceCheckUtils]: 79: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,279 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} #174#return; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#(= main_~c~0 0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2008#(= main_~c~0 0)} is VALID [2022-04-27 10:45:31,280 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#(= main_~c~0 0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 10:45:31,280 INFO L272 TraceCheckUtils]: 83: Hoare triple {2025#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1971#true} is VALID [2022-04-27 10:45:31,280 INFO L290 TraceCheckUtils]: 84: Hoare triple {1971#true} ~cond := #in~cond; {1971#true} is VALID [2022-04-27 10:45:31,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {1971#true} assume !(0 == ~cond); {1971#true} is VALID [2022-04-27 10:45:31,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-27 10:45:31,280 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} #176#return; {2025#(<= 1 main_~c~0)} is VALID [2022-04-27 10:45:31,281 INFO L272 TraceCheckUtils]: 88: Hoare triple {2025#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:45:31,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2031#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:45:31,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {2031#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1972#false} is VALID [2022-04-27 10:45:31,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {1972#false} assume !false; {1972#false} is VALID [2022-04-27 10:45:31,282 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-27 10:45:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:31,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136849213] [2022-04-27 10:45:31,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136849213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:31,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:31,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578161942] [2022-04-27 10:45:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:31,283 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-27 10:45:31,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:31,283 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-27 10:45:31,314 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-27 10:45:31,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:31,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:31,317 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-27 10:45:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,897 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-27 10:45:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:31,897 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-27 10:45:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:31,906 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-27 10:45:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 10:45:31,908 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-27 10:45:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 10:45:31,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-27 10:45:31,967 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-27 10:45:31,967 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:45:31,967 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:45:31,967 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-27 10:45:31,968 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-27 10:45:31,968 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-27 10:45:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:45:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:45:31,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:31,969 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-27 10:45:31,969 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-27 10:45:31,969 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-27 10:45:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:31,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:31,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:31,969 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-27 10:45:31,969 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-27 10:45:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:31,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:31,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:31,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:31,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:31,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:31,970 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-27 10:45:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:45:31,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-27 10:45:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:31,970 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:45:31,970 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-27 10:45:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:31,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:31,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:45:31,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:45:31,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:45:32,267 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:45:32,267 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:45:32,267 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-04-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-04-27 10:45:32,268 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-27 10:45:32,268 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-27 10:45:32,268 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-27 10:45:32,268 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-04-27 10:45:32,269 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-04-27 10:45:32,269 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2022-04-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,269 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-27 10:45:32,270 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 10:45:32,270 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-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 10:45:32,270 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-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-04-27 10:45:32,270 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-27 10:45:32,270 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-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-27 10:45:32,270 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-27 10:45:32,270 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-27 10:45:32,270 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-27 10:45:32,270 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 10:45:32,271 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-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:32,271 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-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:45:32,271 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:45:32,271 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:45:32,272 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:45:32,272 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:45:32,273 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 10:45:32,275 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:45:32,277 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 10:45:32,279 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 10:45:32,281 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:45:32,283 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 10:45:32,284 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:45:32,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:45:32 BoogieIcfgContainer [2022-04-27 10:45:32,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:45:32,291 INFO L158 Benchmark]: Toolchain (without parser) took 6010.90ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 136.3MB in the beginning and 153.1MB in the end (delta: -16.8MB). Peak memory consumption was 53.0MB. Max. memory is 8.0GB. [2022-04-27 10:45:32,291 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:45:32,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.91ms. Allocated memory is still 187.7MB. Free memory was 136.1MB in the beginning and 161.4MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:45:32,291 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 187.7MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:45:32,291 INFO L158 Benchmark]: RCFGBuilder took 367.44ms. Allocated memory is still 187.7MB. Free memory was 159.8MB in the beginning and 143.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 10:45:32,292 INFO L158 Benchmark]: TraceAbstraction took 5350.62ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 142.5MB in the beginning and 153.1MB in the end (delta: -10.5MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-04-27 10:45:32,293 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.09ms. Allocated memory is still 187.7MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.91ms. Allocated memory is still 187.7MB. Free memory was 136.1MB in the beginning and 161.4MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 187.7MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 367.44ms. Allocated memory is still 187.7MB. Free memory was 159.8MB in the beginning and 143.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5350.62ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 142.5MB in the beginning and 153.1MB in the end (delta: -10.5MB). Peak memory consumption was 58.7MB. 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: 5.3s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 300 mSDtfsCounter, 1253 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.2s 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 105 NumberOfFragments, 461 HoareAnnotationTreeSize, 76 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 287 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:45:32,315 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...