/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:15:33,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:15:33,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:15:33,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:15:33,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:15:33,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:15:33,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:15:33,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:15:33,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:15:33,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:15:33,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:15:33,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:15:33,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:15:33,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:15:33,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:15:33,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:15:33,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:15:33,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:15:33,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:15:33,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:15:33,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:15:33,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:15:33,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:15:33,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:15:33,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:15:33,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:15:33,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:15:33,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:15:33,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:15:33,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:15:33,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:15:33,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:15:33,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:15:33,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:15:33,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:15:33,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:15:33,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:15:33,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:15:33,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:15:33,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:15:33,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:15:33,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:15:33,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:15:33,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:15:33,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:15:33,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:15:33,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:15:33,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:15:33,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:15:33,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:15:33,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:15:33,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:33,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:15:33,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:15:33,983 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:15:33,983 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:15:34,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:15:34,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:15:34,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:15:34,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:15:34,211 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:15:34,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-27 16:15:34,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7b1c607/a3c8f5b335ec4bc0b5cfce6f33cd98bc/FLAG24751b504 [2022-04-27 16:15:34,574 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:15:34,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-27 16:15:34,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7b1c607/a3c8f5b335ec4bc0b5cfce6f33cd98bc/FLAG24751b504 [2022-04-27 16:15:35,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7b1c607/a3c8f5b335ec4bc0b5cfce6f33cd98bc [2022-04-27 16:15:35,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:15:35,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:15:35,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:35,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:15:35,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:15:35,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f23c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35, skipping insertion in model container [2022-04-27 16:15:35,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:15:35,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:15:35,167 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-get-tag.i[893,906] [2022-04-27 16:15:35,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:35,213 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:15:35,223 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-get-tag.i[893,906] [2022-04-27 16:15:35,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:35,241 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:15:35,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35 WrapperNode [2022-04-27 16:15:35,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:35,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:15:35,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:15:35,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:15:35,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:15:35,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:15:35,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:15:35,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:15:35,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:15:35,319 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 16:15:35,331 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 16:15:35,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:15:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:15:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:15:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:15:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:15:35,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:15:35,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:15:35,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:15:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:15:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:15:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:15:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:15:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:15:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:15:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:15:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:15:35,415 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:15:35,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:15:35,667 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:15:35,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:15:35,679 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:15:35,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:35 BoogieIcfgContainer [2022-04-27 16:15:35,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:15:35,681 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:15:35,682 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:15:35,688 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:15:35,691 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:35" (1/1) ... [2022-04-27 16:15:35,693 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:15:35,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:15:35 BasicIcfg [2022-04-27 16:15:35,744 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:15:35,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:15:35,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:15:35,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:15:35,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:15:35" (1/4) ... [2022-04-27 16:15:35,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:15:35, skipping insertion in model container [2022-04-27 16:15:35,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:35" (2/4) ... [2022-04-27 16:15:35,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:15:35, skipping insertion in model container [2022-04-27 16:15:35,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:35" (3/4) ... [2022-04-27 16:15:35,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ede0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:15:35, skipping insertion in model container [2022-04-27 16:15:35,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:15:35" (4/4) ... [2022-04-27 16:15:35,751 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.iJordan [2022-04-27 16:15:35,764 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:15:35,765 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:15:35,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:15:35,806 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64b19a62, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1dffb61b [2022-04-27 16:15:35,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:15:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 16:15:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:15:35,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:35,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:35,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1788024088, now seen corresponding path program 1 times [2022-04-27 16:15:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:35,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476234691] [2022-04-27 16:15:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:36,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {51#true} is VALID [2022-04-27 16:15:36,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:36,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {51#true} is VALID [2022-04-27 16:15:36,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {51#true} is VALID [2022-04-27 16:15:36,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-27 16:15:36,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {51#true} is VALID [2022-04-27 16:15:36,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} [169] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-27 16:15:36,048 INFO L272 TraceCheckUtils]: 9: Hoare triple {52#false} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {52#false} is VALID [2022-04-27 16:15:36,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52#false} is VALID [2022-04-27 16:15:36,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-27 16:15:36,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-27 16:15:36,049 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 16:15:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476234691] [2022-04-27 16:15:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476234691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:36,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:15:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846088839] [2022-04-27 16:15:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:15:36,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:36,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:15:36,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:36,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:15:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:15:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:15:36,099 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:15:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:36,280 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-27 16:15:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:15:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:15:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:15:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-04-27 16:15:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:15:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-04-27 16:15:36,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-04-27 16:15:36,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:36,391 INFO L225 Difference]: With dead ends: 48 [2022-04-27 16:15:36,391 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 16:15:36,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:15:36,395 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:36,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:15:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 16:15:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 16:15:36,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:36,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:36,426 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:36,426 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:36,433 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-27 16:15:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 16:15:36,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:36,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:36,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-27 16:15:36,436 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-27 16:15:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:36,441 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-27 16:15:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 16:15:36,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:36,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:36,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:36,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-27 16:15:36,449 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-27 16:15:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:36,449 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-27 16:15:36,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:15:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 16:15:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:15:36,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:36,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:36,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:15:36,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -347621339, now seen corresponding path program 1 times [2022-04-27 16:15:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:36,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739768297] [2022-04-27 16:15:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:36,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {236#true} is VALID [2022-04-27 16:15:36,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:36,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {236#true} is VALID [2022-04-27 16:15:36,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {236#true} is VALID [2022-04-27 16:15:36,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-27 16:15:36,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {241#(<= 0 main_~t~0)} is VALID [2022-04-27 16:15:36,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(<= 0 main_~t~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#(<= 0 main_~t~0)} is VALID [2022-04-27 16:15:36,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(<= 0 main_~t~0)} [174] L33-->L34: Formula: (= v_main_~t~0_17 v_main_~tagbuf_len~0_16) InVars {main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} OutVars{main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} AuxVars[] AssignedVars[] {241#(<= 0 main_~t~0)} is VALID [2022-04-27 16:15:36,625 INFO L272 TraceCheckUtils]: 10: Hoare triple {241#(<= 0 main_~t~0)} [178] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:15:36,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {243#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:15:36,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 16:15:36,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#false} is VALID [2022-04-27 16:15:36,627 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 16:15:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739768297] [2022-04-27 16:15:36,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739768297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:36,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:36,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:15:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165212616] [2022-04-27 16:15:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:36,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 16:15:36,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:36,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16:15:36,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:36,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:15:36,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:36,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:15:36,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:15:36,654 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16:15:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:37,182 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 16:15:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:15:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-27 16:15:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16:15:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 16:15:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16:15:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 16:15:37,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-27 16:15:37,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:37,261 INFO L225 Difference]: With dead ends: 47 [2022-04-27 16:15:37,261 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 16:15:37,263 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 16:15:37,268 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:37,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:15:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 16:15:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 16:15:37,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:37,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:37,285 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:37,286 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:37,295 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 16:15:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 16:15:37,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:37,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:37,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-27 16:15:37,297 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-27 16:15:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:37,300 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 16:15:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 16:15:37,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:37,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:37,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:37,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 16:15:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-27 16:15:37,307 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-27 16:15:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:37,308 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-27 16:15:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16:15:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 16:15:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 16:15:37,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:37,310 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:15:37,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2003510572, now seen corresponding path program 1 times [2022-04-27 16:15:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243958867] [2022-04-27 16:15:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:37,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {443#true} is VALID [2022-04-27 16:15:37,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:15:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:37,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {443#true} is VALID [2022-04-27 16:15:37,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {443#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {443#true} {449#(<= main_~t~0 main_~tagbuf_len~0)} [218] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {449#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:37,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {443#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:37,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {443#true} is VALID [2022-04-27 16:15:37,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {443#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {443#true} {443#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {443#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {443#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {443#true} is VALID [2022-04-27 16:15:37,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {443#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {448#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:37,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {448#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:37,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {448#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} [174] L33-->L34: Formula: (= v_main_~t~0_17 v_main_~tagbuf_len~0_16) InVars {main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} OutVars{main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} AuxVars[] AssignedVars[] {449#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:37,425 INFO L272 TraceCheckUtils]: 10: Hoare triple {449#(<= main_~t~0 main_~tagbuf_len~0)} [178] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {443#true} is VALID [2022-04-27 16:15:37,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {443#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {443#true} is VALID [2022-04-27 16:15:37,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-27 16:15:37,426 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {443#true} {449#(<= main_~t~0 main_~tagbuf_len~0)} [218] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {449#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:37,427 INFO L272 TraceCheckUtils]: 15: Hoare triple {449#(<= main_~t~0 main_~tagbuf_len~0)} [184] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (<= v_main_~t~0_34 v_main_~tagbuf_len~0_22) 1 0)) InVars {main_~t~0=v_main_~t~0_34, main_~tagbuf_len~0=v_main_~tagbuf_len~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:15:37,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {455#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:15:37,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {455#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {444#false} is VALID [2022-04-27 16:15:37,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {444#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#false} is VALID [2022-04-27 16:15:37,428 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 16:15:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:37,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243958867] [2022-04-27 16:15:37,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243958867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:37,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:37,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:15:37,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015070424] [2022-04-27 16:15:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-27 16:15:37,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:37,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16:15:37,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:15:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:15:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:15:37,445 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16:15:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:38,154 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2022-04-27 16:15:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:15:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-27 16:15:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16:15:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 16:15:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16:15:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-27 16:15:38,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-27 16:15:38,247 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 16:15:38,249 INFO L225 Difference]: With dead ends: 60 [2022-04-27 16:15:38,249 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 16:15:38,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:15:38,258 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:38,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:15:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 16:15:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-27 16:15:38,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:38,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 16:15:38,273 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 16:15:38,274 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 16:15:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:38,279 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 16:15:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 16:15:38,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:38,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:38,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-27 16:15:38,281 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-27 16:15:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:38,285 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 16:15:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 16:15:38,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:38,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:38,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:38,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 16:15:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-27 16:15:38,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-27 16:15:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:38,302 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-27 16:15:38,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 16:15:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-27 16:15:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 16:15:38,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:38,303 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:38,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:15:38,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2142117223, now seen corresponding path program 1 times [2022-04-27 16:15:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:38,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755311344] [2022-04-27 16:15:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:38,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {670#true} is VALID [2022-04-27 16:15:38,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {670#true} {670#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 16:15:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:38,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-27 16:15:38,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:38,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {670#true} is VALID [2022-04-27 16:15:38,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {670#true} is VALID [2022-04-27 16:15:38,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {675#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:38,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,404 INFO L272 TraceCheckUtils]: 11: Hoare triple {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {670#true} is VALID [2022-04-27 16:15:38,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-27 16:15:38,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 16:15:38,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 16:15:38,406 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {681#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:15:38,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {681#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {682#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:15:38,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-27 16:15:38,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-27 16:15:38,408 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 16:15:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755311344] [2022-04-27 16:15:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755311344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:38,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:15:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753993576] [2022-04-27 16:15:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-27 16:15:38,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:38,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16:15:38,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:38,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:15:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:15:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:15:38,443 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16:15:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:39,023 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-27 16:15:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:15:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-27 16:15:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16:15:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-27 16:15:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16:15:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-27 16:15:39,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2022-04-27 16:15:39,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:39,106 INFO L225 Difference]: With dead ends: 58 [2022-04-27 16:15:39,106 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 16:15:39,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:15:39,107 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:15:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 16:15:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-27 16:15:39,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:39,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 16:15:39,112 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 16:15:39,112 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 16:15:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:39,120 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-27 16:15:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 16:15:39,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:39,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:39,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 16:15:39,121 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 16:15:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:39,124 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-27 16:15:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 16:15:39,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:39,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:39,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:39,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 16:15:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-27 16:15:39,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-27 16:15:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:39,129 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-27 16:15:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16:15:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 16:15:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 16:15:39,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:39,130 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:39,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:15:39,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1358705581, now seen corresponding path program 1 times [2022-04-27 16:15:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:39,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536156640] [2022-04-27 16:15:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {929#true} is VALID [2022-04-27 16:15:39,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {929#true} {929#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 16:15:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 16:15:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 16:15:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:39,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {929#true} is VALID [2022-04-27 16:15:39,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:39,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {934#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:39,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {935#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {935#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {935#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,351 INFO L272 TraceCheckUtils]: 11: Hoare triple {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:39,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {929#true} {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,354 INFO L272 TraceCheckUtils]: 16: Hoare triple {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:39,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,358 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {929#true} {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {936#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,373 INFO L272 TraceCheckUtils]: 25: Hoare triple {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:39,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:39,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:39,374 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {929#true} {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 16:15:39,375 INFO L272 TraceCheckUtils]: 30: Hoare triple {945#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {950#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:15:39,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {950#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {951#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:15:39,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {951#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:39,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {930#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 16:15:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:39,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536156640] [2022-04-27 16:15:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536156640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:15:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531174035] [2022-04-27 16:15:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:39,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:15:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:15:39,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:15:39,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:15:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:15:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:39,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:15:40,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {929#true} is VALID [2022-04-27 16:15:40,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {934#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {977#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-27 16:15:40,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {977#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {977#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-27 16:15:40,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {977#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 16:15:40,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 16:15:40,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {929#true} {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 16:15:40,134 INFO L272 TraceCheckUtils]: 16: Hoare triple {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,134 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {929#true} {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 16:15:40,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {984#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 16:15:40,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 16:15:40,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 16:15:40,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 16:15:40,137 INFO L272 TraceCheckUtils]: 25: Hoare triple {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,138 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {929#true} {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 16:15:40,139 INFO L272 TraceCheckUtils]: 30: Hoare triple {1021#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1049#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:15:40,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#(<= 1 |__VERIFIER_assert_#in~cond|)} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1053#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:15:40,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {1053#(<= 1 __VERIFIER_assert_~cond)} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:40,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {930#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 16:15:40,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:15:40,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {930#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:40,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {1053#(<= 1 __VERIFIER_assert_~cond)} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-27 16:15:40,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#(<= 1 |__VERIFIER_assert_#in~cond|)} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1053#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:15:40,385 INFO L272 TraceCheckUtils]: 30: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1049#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:15:40,385 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {929#true} {1069#(<= main_~t~0 main_~tagbuf_len~0)} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,386 INFO L272 TraceCheckUtils]: 25: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,390 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {929#true} {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,392 INFO L272 TraceCheckUtils]: 16: Hoare triple {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {929#true} {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {929#true} is VALID [2022-04-27 16:15:40,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1097#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(<= main_~t~0 main_~tagbuf_len~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {1069#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {934#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 16:15:40,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {929#true} is VALID [2022-04-27 16:15:40,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {929#true} is VALID [2022-04-27 16:15:40,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-27 16:15:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 16:15:40,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531174035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:15:40,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:15:40,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-27 16:15:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788399492] [2022-04-27 16:15:40,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:15:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-27 16:15:40,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:40,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 16:15:40,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:40,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 16:15:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 16:15:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:15:40,475 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 16:15:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:41,711 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-04-27 16:15:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:15:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-27 16:15:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 16:15:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-27 16:15:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 16:15:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-27 16:15:41,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2022-04-27 16:15:41,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:41,836 INFO L225 Difference]: With dead ends: 78 [2022-04-27 16:15:41,836 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:15:41,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-04-27 16:15:41,837 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:41,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 61 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 16:15:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:15:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:15:41,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:41,839 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 16:15:41,839 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 16:15:41,839 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 16:15:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:41,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:15:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:41,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:41,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:41,840 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 16:15:41,840 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 16:15:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:41,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:15:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:41,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:41,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:41,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:41,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:41,841 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 16:15:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:15:41,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-27 16:15:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:41,841 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:15:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 16:15:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:41,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:41,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:15:41,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:15:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:15:42,070 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 16:15:42,071 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:15:42,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:15:42 BasicIcfg [2022-04-27 16:15:42,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:15:42,075 INFO L158 Benchmark]: Toolchain (without parser) took 7066.71ms. Allocated memory was 194.0MB in the beginning and 271.6MB in the end (delta: 77.6MB). Free memory was 137.4MB in the beginning and 126.6MB in the end (delta: 10.8MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,075 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:15:42,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.66ms. Allocated memory was 194.0MB in the beginning and 271.6MB in the end (delta: 77.6MB). Free memory was 137.2MB in the beginning and 241.5MB in the end (delta: -104.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,076 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 271.6MB. Free memory was 241.5MB in the beginning and 239.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,076 INFO L158 Benchmark]: RCFGBuilder took 399.36ms. Allocated memory is still 271.6MB. Free memory was 239.5MB in the beginning and 225.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,076 INFO L158 Benchmark]: IcfgTransformer took 62.65ms. Allocated memory is still 271.6MB. Free memory was 225.3MB in the beginning and 222.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,077 INFO L158 Benchmark]: TraceAbstraction took 6328.64ms. Allocated memory is still 271.6MB. Free memory was 222.3MB in the beginning and 126.6MB in the end (delta: 95.7MB). Peak memory consumption was 97.1MB. Max. memory is 8.0GB. [2022-04-27 16:15:42,078 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.66ms. Allocated memory was 194.0MB in the beginning and 271.6MB in the end (delta: 77.6MB). Free memory was 137.2MB in the beginning and 241.5MB in the end (delta: -104.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 271.6MB. Free memory was 241.5MB in the beginning and 239.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 399.36ms. Allocated memory is still 271.6MB. Free memory was 239.5MB in the beginning and 225.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 62.65ms. Allocated memory is still 271.6MB. Free memory was 225.3MB in the beginning and 222.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6328.64ms. Allocated memory is still 271.6MB. Free memory was 222.3MB in the beginning and 126.6MB in the end (delta: 95.7MB). Peak memory consumption was 97.1MB. 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 4 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 897 IncrementalHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 199 mSDtfsCounter, 897 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 1 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 60/67 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 16:15:42,124 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...