/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-34549b5 [2022-04-07 17:01:50,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:01:50,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:01:50,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:01:50,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:01:50,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:01:50,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:01:50,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:01:50,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:01:50,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:01:50,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:01:50,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:01:50,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:01:50,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:01:50,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:01:50,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:01:50,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:01:50,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:01:50,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:01:50,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:01:50,761 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:01:50,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:01:50,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:01:50,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:01:50,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:01:50,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:01:50,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:01:50,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:01:50,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:01:50,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:01:50,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:01:50,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:01:50,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:01:50,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:01:50,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:01:50,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:01:50,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:01:50,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:01:50,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:01:50,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:01:50,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:01:50,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:01:50,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:01:50,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:01:50,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:01:50,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:01:50,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:01:50,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:01:50,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:01:50,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:01:50,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:01:50,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:01:50,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:01:50,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:01:50,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:01:50,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:01:50,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:01:50,787 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:01:50,787 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-07 17:01:50,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:01:50,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:01:50,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:01:50,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:01:50,957 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:01:50,957 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-07 17:01:51,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fda120b9/9adc7b2f2b5348f4a8b79b300ef14079/FLAGedc00e8d6 [2022-04-07 17:01:51,394 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:01:51,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-07 17:01:51,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fda120b9/9adc7b2f2b5348f4a8b79b300ef14079/FLAGedc00e8d6 [2022-04-07 17:01:51,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fda120b9/9adc7b2f2b5348f4a8b79b300ef14079 [2022-04-07 17:01:51,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:01:51,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:01:51,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:01:51,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:01:51,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:01:51,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:01:51" (1/1) ... [2022-04-07 17:01:51,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49326445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:51, skipping insertion in model container [2022-04-07 17:01:51,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:01:51" (1/1) ... [2022-04-07 17:01:51,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:01:51,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:01:52,030 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-07 17:01:52,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:01:52,054 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:01:52,066 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-07 17:01:52,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:01:52,095 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:01:52,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52 WrapperNode [2022-04-07 17:01:52,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:01:52,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:01:52,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:01:52,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:01:52,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:01:52,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:01:52,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:01:52,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:01:52,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:01:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:01:52,200 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-07 17:01:52,266 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-07 17:01:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:01:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:01:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:01:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:01:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:01:52,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:01:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:01:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:01:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:01:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:01:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:01:52,370 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:01:52,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:01:52,615 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:01:52,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:01:52,621 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 17:01:52,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:01:52 BoogieIcfgContainer [2022-04-07 17:01:52,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:01:52,623 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:01:52,623 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:01:52,624 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:01:52,630 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:01:52" (1/1) ... [2022-04-07 17:01:52,632 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:01:52,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:01:52 BasicIcfg [2022-04-07 17:01:52,669 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:01:52,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:01:52,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:01:52,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:01:52,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:01:51" (1/4) ... [2022-04-07 17:01:52,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3c7a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:01:52, skipping insertion in model container [2022-04-07 17:01:52,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:01:52" (2/4) ... [2022-04-07 17:01:52,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3c7a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:01:52, skipping insertion in model container [2022-04-07 17:01:52,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:01:52" (3/4) ... [2022-04-07 17:01:52,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3c7a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:01:52, skipping insertion in model container [2022-04-07 17:01:52,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:01:52" (4/4) ... [2022-04-07 17:01:52,675 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.iJordan [2022-04-07 17:01:52,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:01:52,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:01:52,707 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:01:52,711 INFO L340 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 [2022-04-07 17:01:52,711 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:01:52,722 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-07 17:01:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 17:01:52,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:52,728 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:01:52,729 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1788024088, now seen corresponding path program 1 times [2022-04-07 17:01:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:52,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983210371] [2022-04-07 17:01:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:01:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:52,839 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-07 17:01:52,840 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-07 17:01:52,840 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-07 17:01:52,841 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-07 17:01:52,841 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-07 17:01:52,841 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-07 17:01:52,841 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-07 17:01:52,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-07 17:01:52,842 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-07 17:01:52,842 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-07 17:01:52,842 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-07 17:01:52,843 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-07 17:01:52,843 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-07 17:01:52,843 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-07 17:01:52,843 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-07 17:01:52,843 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-07 17:01:52,844 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-07 17:01:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:01:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983210371] [2022-04-07 17:01:52,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983210371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:01:52,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:01:52,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:01:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631171598] [2022-04-07 17:01:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:01:52,849 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-07 17:01:52,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:01:52,852 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-07 17:01:52,864 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-07 17:01:52,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:01:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:01:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:01:52,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:01:52,878 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-07 17:01:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:53,110 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 17:01:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:01:53,110 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-07 17:01:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:53,117 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-07 17:01:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-04-07 17:01:53,129 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-07 17:01:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-04-07 17:01:53,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-04-07 17:01:53,252 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-07 17:01:53,263 INFO L225 Difference]: With dead ends: 48 [2022-04-07 17:01:53,263 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 17:01:53,265 INFO L912 BasicCegarLoop]: 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-07 17:01:53,270 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:01:53,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:01:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 17:01:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-07 17:01:53,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:53,296 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-07 17:01:53,297 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-07 17:01:53,297 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-07 17:01:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:53,301 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-07 17:01:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-07 17:01:53,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:53,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:53,303 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-07 17:01:53,303 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-07 17:01:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:53,307 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-07 17:01:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-07 17:01:53,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:53,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:53,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:53,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:53,309 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-07 17:01:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-07 17:01:53,313 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-07 17:01:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:53,313 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-07 17:01:53,313 INFO L479 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-07 17:01:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-07 17:01:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:01:53,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:53,314 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:01:53,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:01:53,314 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -347621339, now seen corresponding path program 1 times [2022-04-07 17:01:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143856343] [2022-04-07 17:01:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:01:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:53,432 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-07 17:01:53,432 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-07 17:01:53,432 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-07 17:01:53,434 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-07 17:01:53,434 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-07 17:01:53,434 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-07 17:01:53,434 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-07 17:01:53,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#true} is VALID [2022-04-07 17:01:53,435 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-07 17:01:53,435 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-07 17:01:53,436 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-07 17:01:53,436 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-07 17:01:53,437 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-07 17:01:53,438 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-07 17:01:53,439 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-07 17:01:53,439 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-07 17:01:53,439 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-07 17:01:53,440 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-07 17:01:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:01:53,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143856343] [2022-04-07 17:01:53,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143856343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:01:53,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:01:53,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:01:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092382582] [2022-04-07 17:01:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:01:53,442 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-07 17:01:53,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:01:53,442 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-07 17:01:53,453 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-07 17:01:53,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:01:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:01:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:01:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:01:53,456 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-07 17:01:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:53,955 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-07 17:01:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:01:53,956 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-07 17:01:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:53,956 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-07 17:01:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-07 17:01:53,959 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-07 17:01:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-07 17:01:53,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-07 17:01:54,025 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-07 17:01:54,027 INFO L225 Difference]: With dead ends: 47 [2022-04-07 17:01:54,027 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 17:01:54,027 INFO L912 BasicCegarLoop]: 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-07 17:01:54,028 INFO L913 BasicCegarLoop]: 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-07 17:01:54,028 INFO L914 BasicCegarLoop]: 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-07 17:01:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 17:01:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-07 17:01:54,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:54,033 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-07 17:01:54,034 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-07 17:01:54,034 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-07 17:01:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:54,036 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-07 17:01:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-07 17:01:54,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:54,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:54,038 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-07 17:01:54,038 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-07 17:01:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:54,040 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-07 17:01:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-07 17:01:54,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:54,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:54,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:54,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:54,042 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-07 17:01:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-07 17:01:54,044 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-07 17:01:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:54,044 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-07 17:01:54,044 INFO L479 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-07 17:01:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-07 17:01:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 17:01:54,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:54,045 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:01:54,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:01:54,045 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2003510572, now seen corresponding path program 1 times [2022-04-07 17:01:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653610675] [2022-04-07 17:01:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:01:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:54,135 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-07 17:01:54,135 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-07 17:01:54,136 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-07 17:01:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 17:01:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:54,142 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-07 17:01:54,143 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-07 17:01:54,143 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-07 17:01:54,144 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-07 17:01:54,144 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-07 17:01:54,145 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-07 17:01:54,145 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-07 17:01:54,145 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-07 17:01:54,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {443#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {443#true} is VALID [2022-04-07 17:01:54,145 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-07 17:01:54,146 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-07 17:01:54,146 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-07 17:01:54,147 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-07 17:01:54,147 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-07 17:01:54,148 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-07 17:01:54,148 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-07 17:01:54,148 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-07 17:01:54,148 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-07 17:01:54,149 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-07 17:01:54,150 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-07 17:01:54,150 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-07 17:01:54,150 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-07 17:01:54,151 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-07 17:01:54,151 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-07 17:01:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:01:54,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653610675] [2022-04-07 17:01:54,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653610675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:01:54,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:01:54,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 17:01:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985569939] [2022-04-07 17:01:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:01:54,153 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-07 17:01:54,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:01:54,187 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-07 17:01:54,252 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-07 17:01:54,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:01:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:01:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:01:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:01:54,253 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-07 17:01:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:54,944 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2022-04-07 17:01:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:01:54,944 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-07 17:01:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:54,945 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-07 17:01:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-07 17:01:54,948 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-07 17:01:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-07 17:01:54,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-07 17:01:55,028 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-07 17:01:55,030 INFO L225 Difference]: With dead ends: 60 [2022-04-07 17:01:55,030 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 17:01:55,030 INFO L912 BasicCegarLoop]: 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-07 17:01:55,031 INFO L913 BasicCegarLoop]: 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-07 17:01:55,032 INFO L914 BasicCegarLoop]: 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-07 17:01:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 17:01:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-07 17:01:55,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:55,037 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-07 17:01:55,037 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-07 17:01:55,037 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-07 17:01:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:55,040 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-07 17:01:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-07 17:01:55,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:55,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:55,041 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-07 17:01:55,041 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-07 17:01:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:55,043 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-07 17:01:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-07 17:01:55,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:55,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:55,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:55,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:55,044 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-07 17:01:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-07 17:01:55,045 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-07 17:01:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:55,046 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-07 17:01:55,046 INFO L479 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-07 17:01:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-07 17:01:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 17:01:55,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:55,046 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:01:55,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 17:01:55,047 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2142117223, now seen corresponding path program 1 times [2022-04-07 17:01:55,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:55,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944336162] [2022-04-07 17:01:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:55,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:01:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,145 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-07 17:01:55,145 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-07 17:01:55,146 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-07 17:01:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 17:01:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,158 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-07 17:01:55,158 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-07 17:01:55,159 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-07 17:01:55,159 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-07 17:01:55,160 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-07 17:01:55,160 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-07 17:01:55,161 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-07 17:01:55,161 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-07 17:01:55,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-07 17:01:55,161 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-07 17:01:55,162 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-07 17:01:55,163 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-07 17:01:55,163 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-07 17:01:55,163 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-07 17:01:55,164 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-07 17:01:55,164 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-07 17:01:55,164 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-07 17:01:55,165 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-07 17:01:55,165 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-07 17:01:55,165 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-07 17:01:55,166 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-07 17:01:55,166 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-07 17:01:55,167 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-07 17:01:55,167 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-07 17:01:55,167 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-07 17:01:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:01:55,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944336162] [2022-04-07 17:01:55,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944336162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:01:55,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:01:55,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 17:01:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240838027] [2022-04-07 17:01:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:01:55,169 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-07 17:01:55,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:01:55,170 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-07 17:01:55,181 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-07 17:01:55,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:01:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:01:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:01:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:01:55,183 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-07 17:01:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:55,611 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-07 17:01:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 17:01:55,611 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-07 17:01:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:55,612 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-07 17:01:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-07 17:01:55,613 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-07 17:01:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-07 17:01:55,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2022-04-07 17:01:55,664 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-07 17:01:55,665 INFO L225 Difference]: With dead ends: 58 [2022-04-07 17:01:55,666 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 17:01:55,666 INFO L912 BasicCegarLoop]: 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-07 17:01:55,667 INFO L913 BasicCegarLoop]: 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-07 17:01:55,667 INFO L914 BasicCegarLoop]: 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-07 17:01:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 17:01:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-07 17:01:55,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:55,673 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-07 17:01:55,673 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-07 17:01:55,673 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-07 17:01:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:55,675 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-07 17:01:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-07 17:01:55,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:55,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:55,676 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-07 17:01:55,677 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-07 17:01:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:55,679 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-07 17:01:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-07 17:01:55,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:55,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:55,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:55,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:55,680 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-07 17:01:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-07 17:01:55,682 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-07 17:01:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:55,682 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-07 17:01:55,682 INFO L479 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-07 17:01:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-07 17:01:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 17:01:55,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:55,683 INFO L499 BasicCegarLoop]: 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-07 17:01:55,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 17:01:55,683 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1358705581, now seen corresponding path program 1 times [2022-04-07 17:01:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:55,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874417745] [2022-04-07 17:01:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:01:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,799 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-07 17:01:55,799 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-07 17:01:55,799 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-07 17:01:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 17:01:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,804 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-07 17:01:55,804 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-07 17:01:55,804 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-07 17:01:55,805 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-07 17:01:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 17:01:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,812 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-07 17:01:55,812 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-07 17:01:55,812 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-07 17:01:55,813 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-07 17:01:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 17:01:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,817 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-07 17:01:55,817 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-07 17:01:55,817 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-07 17:01:55,818 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-07 17:01:55,819 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-07 17:01:55,819 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-07 17:01:55,819 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-07 17:01:55,819 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-07 17:01:55,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-07 17:01:55,820 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-07 17:01:55,820 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-07 17:01:55,821 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-07 17:01:55,821 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-07 17:01:55,822 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-07 17:01:55,822 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-07 17:01:55,822 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-07 17:01:55,822 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-07 17:01:55,822 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-07 17:01:55,823 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-07 17:01:55,823 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-07 17:01:55,823 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-07 17:01:55,824 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-07 17:01:55,824 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-07 17:01:55,824 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-07 17:01:55,824 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-07 17:01:55,825 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-07 17:01:55,825 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-07 17:01:55,826 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-07 17:01:55,826 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-07 17:01:55,826 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-07 17:01:55,826 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-07 17:01:55,827 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-07 17:01:55,827 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-07 17:01:55,827 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-07 17:01:55,828 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-07 17:01:55,828 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-07 17:01:55,829 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-07 17:01:55,829 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-07 17:01:55,829 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-07 17:01:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:01:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874417745] [2022-04-07 17:01:55,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874417745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:01:55,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236481126] [2022-04-07 17:01:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:01:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:01:55,836 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-07 17:01:55,842 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-07 17:01:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 17:01:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:01:55,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:01:56,509 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-07 17:01:56,509 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-07 17:01:56,510 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-07 17:01:56,510 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-07 17:01:56,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-07 17:01:56,510 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-07 17:01:56,514 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-07 17:01:56,515 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-07 17:01:56,516 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-07 17:01:56,517 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-07 17:01:56,517 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-07 17:01:56,518 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-07 17:01:56,518 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-07 17:01:56,518 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-07 17:01:56,518 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-07 17:01:56,519 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-07 17:01:56,519 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-07 17:01:56,519 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-07 17:01:56,519 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-07 17:01:56,519 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-07 17:01:56,531 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-07 17:01:56,532 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-07 17:01:56,533 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-07 17:01:56,533 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-07 17:01:56,533 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-07 17:01:56,534 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-07 17:01:56,534 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-07 17:01:56,534 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-07 17:01:56,534 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-07 17:01:56,535 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-07 17:01:56,535 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-07 17:01:56,536 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-07 17:01:56,536 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-07 17:01:56,536 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-07 17:01:56,537 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-07 17:01:56,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:01:56,727 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-07 17:01:56,735 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-07 17:01:56,735 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-07 17:01:56,736 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-07 17:01:56,737 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-07 17:01:56,737 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-07 17:01:56,737 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-07 17:01:56,737 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-07 17:01:56,737 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-07 17:01:56,738 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-07 17:01:56,739 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-07 17:01:56,739 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-07 17:01:56,740 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-07 17:01:56,741 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-07 17:01:56,741 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-07 17:01:56,743 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-07 17:01:56,743 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-07 17:01:56,744 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-07 17:01:56,744 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-07 17:01:56,744 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-07 17:01:56,744 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-07 17:01:56,745 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-07 17:01:56,745 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-07 17:01:56,745 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-07 17:01:56,746 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-07 17:01:56,746 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-07 17:01:56,746 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-07 17:01:56,747 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-07 17:01:56,747 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-07 17:01:56,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-07 17:01:56,749 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-07 17:01:56,750 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-07 17:01:56,750 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-07 17:01:56,750 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-07 17:01:56,750 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-07 17:01:56,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236481126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:01:56,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:01:56,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-07 17:01:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954623337] [2022-04-07 17:01:56,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:01:56,753 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-07 17:01:56,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:01:56,756 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-07 17:01:56,792 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-07 17:01:56,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 17:01:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:01:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 17:01:56,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-07 17:01:56,796 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-07 17:01:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:57,680 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-04-07 17:01:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 17:01:57,681 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-07 17:01:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:57,684 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-07 17:01:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-07 17:01:57,688 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-07 17:01:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-04-07 17:01:57,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2022-04-07 17:01:57,823 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-07 17:01:57,823 INFO L225 Difference]: With dead ends: 78 [2022-04-07 17:01:57,823 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:01:57,823 INFO L912 BasicCegarLoop]: 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-07 17:01:57,824 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:01:57,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 61 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 17:01:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:01:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:01:57,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:57,825 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-07 17:01:57,825 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-07 17:01:57,825 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-07 17:01:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:57,825 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:01:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:01:57,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:57,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:57,826 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-07 17:01:57,826 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-07 17:01:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:57,826 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:01:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:01:57,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:57,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:57,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:57,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:57,826 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-07 17:01:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:01:57,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-07 17:01:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:57,827 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:01:57,827 INFO L479 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-07 17:01:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:01:57,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:57,829 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:01:57,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 17:01:58,043 WARN L460 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-07 17:01:58,046 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 17:01:58,048 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:01:58,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:01:58 BasicIcfg [2022-04-07 17:01:58,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:01:58,054 INFO L158 Benchmark]: Toolchain (without parser) took 6213.00ms. Allocated memory was 240.1MB in the beginning and 290.5MB in the end (delta: 50.3MB). Free memory was 190.7MB in the beginning and 252.3MB in the end (delta: -61.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 240.1MB. Free memory is still 207.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.85ms. Allocated memory is still 240.1MB. Free memory was 190.5MB in the beginning and 215.1MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 240.1MB. Free memory was 215.1MB in the beginning and 213.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: RCFGBuilder took 488.45ms. Allocated memory is still 240.1MB. Free memory was 213.5MB in the beginning and 198.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: IcfgTransformer took 46.67ms. Allocated memory is still 240.1MB. Free memory was 198.3MB in the beginning and 196.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:01:58,055 INFO L158 Benchmark]: TraceAbstraction took 5383.32ms. Allocated memory was 240.1MB in the beginning and 290.5MB in the end (delta: 50.3MB). Free memory was 195.7MB in the beginning and 252.3MB in the end (delta: -56.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:01:58,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 240.1MB. Free memory is still 207.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.85ms. Allocated memory is still 240.1MB. Free memory was 190.5MB in the beginning and 215.1MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 240.1MB. Free memory was 215.1MB in the beginning and 213.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.45ms. Allocated memory is still 240.1MB. Free memory was 213.5MB in the beginning and 198.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 46.67ms. Allocated memory is still 240.1MB. Free memory was 198.3MB in the beginning and 196.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5383.32ms. Allocated memory was 240.1MB in the beginning and 290.5MB in the end (delta: 50.3MB). Free memory was 195.7MB in the beginning and 252.3MB in the end (delta: -56.6MB). There was no memory consumed. 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: 5.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 1.2s 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.3s 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-07 17:01:58,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...