/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:46:17,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:46:17,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:46:17,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:46:17,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:46:17,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:46:17,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:46:17,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:46:17,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:46:17,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:46:17,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:46:17,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:46:17,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:46:17,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:46:17,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:46:17,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:46:17,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:46:17,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:46:17,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:46:17,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:46:17,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:46:17,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:46:17,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:46:17,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:46:17,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:46:17,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:46:17,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:46:17,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:46:17,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:46:17,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:46:17,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:46:17,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:46:17,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:46:17,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:46:17,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:46:17,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:46:17,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:46:17,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:46:17,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:46:17,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:46:17,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:46:17,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:46:17,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:46:17,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:46:17,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:46:17,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:46:17,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:46:17,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:46:17,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:46:17,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:46:17,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:46:17,178 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:46:17,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:46:17,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:46:17,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:17,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:46:17,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:46:17,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:46:17,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:46:17,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:46:17,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:46:17,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:46:17,377 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:46:17,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-27 10:46:17,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069b15607/0050f39f0a7a47938a7dbd5cb31fbbf9/FLAGae2272a74 [2022-04-27 10:46:17,799 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:46:17,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-27 10:46:17,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069b15607/0050f39f0a7a47938a7dbd5cb31fbbf9/FLAGae2272a74 [2022-04-27 10:46:17,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069b15607/0050f39f0a7a47938a7dbd5cb31fbbf9 [2022-04-27 10:46:17,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:46:17,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:46:17,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:17,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:46:17,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:46:17,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:17" (1/1) ... [2022-04-27 10:46:17,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28126535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:17, skipping insertion in model container [2022-04-27 10:46:17,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:46:17" (1/1) ... [2022-04-27 10:46:17,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:46:17,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:46:17,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i[893,906] [2022-04-27 10:46:17,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:17,980 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:46:17,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i[893,906] [2022-04-27 10:46:17,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:46:18,002 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:46:18,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18 WrapperNode [2022-04-27 10:46:18,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:46:18,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:46:18,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:46:18,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:46:18,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:46:18,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:46:18,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:46:18,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:46:18,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (1/1) ... [2022-04-27 10:46:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:46:18,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:18,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:46:18,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:46:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:46:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:46:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:46:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:46:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:46:18,117 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:46:18,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:46:18,285 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:46:18,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:46:18,290 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:46:18,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:18 BoogieIcfgContainer [2022-04-27 10:46:18,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:46:18,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:46:18,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:46:18,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:46:18,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:46:17" (1/3) ... [2022-04-27 10:46:18,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcaa7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:18, skipping insertion in model container [2022-04-27 10:46:18,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:46:18" (2/3) ... [2022-04-27 10:46:18,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcaa7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:46:18, skipping insertion in model container [2022-04-27 10:46:18,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:46:18" (3/3) ... [2022-04-27 10:46:18,296 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-04-27 10:46:18,305 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:46:18,306 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:46:18,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:46:18,343 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@256b25db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@662c5f5d [2022-04-27 10:46:18,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:46:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:46:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:46:18,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:18,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:18,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2022-04-27 10:46:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:18,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915096793] [2022-04-27 10:46:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:18,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {51#true} is VALID [2022-04-27 10:46:18,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-27 10:46:18,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-27 10:46:18,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:18,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {51#true} is VALID [2022-04-27 10:46:18,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-27 10:46:18,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-27 10:46:18,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret11 := main(); {51#true} is VALID [2022-04-27 10:46:18,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {51#true} is VALID [2022-04-27 10:46:18,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume ~tagbuf_len~0 >= 1; {51#true} is VALID [2022-04-27 10:46:18,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {51#true} is VALID [2022-04-27 10:46:18,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-04-27 10:46:18,506 INFO L272 TraceCheckUtils]: 9: Hoare triple {52#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {52#false} is VALID [2022-04-27 10:46:18,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2022-04-27 10:46:18,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2022-04-27 10:46:18,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-27 10:46:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:18,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915096793] [2022-04-27 10:46:18,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915096793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:18,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:18,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:46:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764292228] [2022-04-27 10:46:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:46:18,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:18,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:18,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:46:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:46:18,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:46:18,545 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:18,779 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-04-27 10:46:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:46:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:46:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-27 10:46:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-27 10:46:18,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-04-27 10:46:18,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:18,964 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:46:18,965 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 10:46:18,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:46:18,972 INFO L413 NwaCegarLoop]: 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-27 10:46:18,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:46:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 10:46:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 10:46:18,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:19,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,000 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,001 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,005 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-27 10:46:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 10:46:19,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-27 10:46:19,007 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-27 10:46:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,011 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-27 10:46:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 10:46:19,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:19,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-27 10:46:19,016 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-27 10:46:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:19,016 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-27 10:46:19,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 10:46:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:46:19,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:19,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:19,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:46:19,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2022-04-27 10:46:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136672198] [2022-04-27 10:46:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:19,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {343#true} is VALID [2022-04-27 10:46:19,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-27 10:46:19,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} #156#return; {343#true} is VALID [2022-04-27 10:46:19,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:19,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {343#true} is VALID [2022-04-27 10:46:19,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-27 10:46:19,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #156#return; {343#true} is VALID [2022-04-27 10:46:19,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {343#true} call #t~ret11 := main(); {343#true} is VALID [2022-04-27 10:46:19,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {343#true} is VALID [2022-04-27 10:46:19,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#true} assume ~tagbuf_len~0 >= 1; {343#true} is VALID [2022-04-27 10:46:19,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {348#(<= 0 main_~t~0)} is VALID [2022-04-27 10:46:19,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(<= 0 main_~t~0)} assume !false; {348#(<= 0 main_~t~0)} is VALID [2022-04-27 10:46:19,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {348#(<= 0 main_~t~0)} is VALID [2022-04-27 10:46:19,092 INFO L272 TraceCheckUtils]: 10: Hoare triple {348#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {349#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:19,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {350#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:19,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {344#false} is VALID [2022-04-27 10:46:19,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-04-27 10:46:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136672198] [2022-04-27 10:46:19,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136672198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:19,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:46:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660747716] [2022-04-27 10:46:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:46:19,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:19,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:19,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:46:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:46:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:46:19,105 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,544 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 10:46:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:46:19,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:46:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 10:46:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 10:46:19,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-27 10:46:19,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:19,604 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:46:19,604 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:46:19,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:46:19,605 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:19,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:46:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 10:46:19,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:19,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,620 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,621 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,623 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 10:46:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 10:46:19,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-27 10:46:19,625 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-27 10:46:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:19,627 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 10:46:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 10:46:19,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:19,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:19,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:19,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 10:46:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-27 10:46:19,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-27 10:46:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-27 10:46:19,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:46:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 10:46:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:46:19,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:19,631 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:19,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:46:19,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2022-04-27 10:46:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:19,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706702599] [2022-04-27 10:46:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:19,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {600#true} is VALID [2022-04-27 10:46:19,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-27 10:46:19,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {600#true} {600#true} #156#return; {600#true} is VALID [2022-04-27 10:46:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:46:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:19,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} ~cond := #in~cond; {600#true} is VALID [2022-04-27 10:46:19,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume !(0 == ~cond); {600#true} is VALID [2022-04-27 10:46:19,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-27 10:46:19,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {606#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:19,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {600#true} call ULTIMATE.init(); {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:19,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {600#true} is VALID [2022-04-27 10:46:19,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-27 10:46:19,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {600#true} #156#return; {600#true} is VALID [2022-04-27 10:46:19,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {600#true} call #t~ret11 := main(); {600#true} is VALID [2022-04-27 10:46:19,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {600#true} is VALID [2022-04-27 10:46:19,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#true} assume ~tagbuf_len~0 >= 1; {600#true} is VALID [2022-04-27 10:46:19,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:19,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:19,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume ~t~0 == ~tagbuf_len~0; {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:19,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {606#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {600#true} is VALID [2022-04-27 10:46:19,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {600#true} ~cond := #in~cond; {600#true} is VALID [2022-04-27 10:46:19,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#true} assume !(0 == ~cond); {600#true} is VALID [2022-04-27 10:46:19,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#true} assume true; {600#true} is VALID [2022-04-27 10:46:19,726 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {600#true} {606#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:19,727 INFO L272 TraceCheckUtils]: 15: Hoare triple {606#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:19,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:19,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {601#false} is VALID [2022-04-27 10:46:19,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#false} assume !false; {601#false} is VALID [2022-04-27 10:46:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706702599] [2022-04-27 10:46:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706702599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:19,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:19,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492194324] [2022-04-27 10:46:19,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:46:19,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:19,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:19,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:19,744 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,390 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-27 10:46:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:46:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:46:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 10:46:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 10:46:20,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-27 10:46:20,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:20,465 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:46:20,465 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 10:46:20,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:46:20,466 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:20,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:46:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 10:46:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-27 10:46:20,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:20,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:46:20,479 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:46:20,479 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:46:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,481 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 10:46:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 10:46:20,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:20,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:20,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-27 10:46:20,482 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-27 10:46:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:20,484 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 10:46:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 10:46:20,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:20,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:20,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:20,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:46:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-27 10:46:20,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-27 10:46:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:20,486 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-27 10:46:20,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-27 10:46:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:46:20,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:20,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:20,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:46:20,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2022-04-27 10:46:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:20,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824134778] [2022-04-27 10:46:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {877#true} is VALID [2022-04-27 10:46:20,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 10:46:20,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {877#true} {877#true} #156#return; {877#true} is VALID [2022-04-27 10:46:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:46:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:20,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 10:46:20,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 10:46:20,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 10:46:20,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:20,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {877#true} is VALID [2022-04-27 10:46:20,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 10:46:20,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #156#return; {877#true} is VALID [2022-04-27 10:46:20,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret11 := main(); {877#true} is VALID [2022-04-27 10:46:20,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {877#true} is VALID [2022-04-27 10:46:20,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#true} assume ~tagbuf_len~0 >= 1; {882#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:20,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume 0 != #t~nondet3;havoc #t~nondet3; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {877#true} is VALID [2022-04-27 10:46:20,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 10:46:20,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 10:46:20,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 10:46:20,555 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-27 10:46:20,556 INFO L272 TraceCheckUtils]: 16: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:20,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {889#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:20,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {878#false} is VALID [2022-04-27 10:46:20,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 10:46:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:46:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824134778] [2022-04-27 10:46:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824134778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:46:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:46:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:46:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340240848] [2022-04-27 10:46:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:46:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 10:46:20,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:20,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:20,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:46:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:46:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:46:20,571 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,153 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 10:46:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:46:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 10:46:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-27 10:46:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-27 10:46:21,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-27 10:46:21,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:21,219 INFO L225 Difference]: With dead ends: 60 [2022-04-27 10:46:21,219 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 10:46:21,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:46:21,220 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:21,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:46:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 10:46:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-27 10:46:21,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:21,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 10:46:21,244 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 10:46:21,244 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 10:46:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,246 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-27 10:46:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 10:46:21,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:21,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:21,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 10:46:21,247 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-27 10:46:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:21,249 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-27 10:46:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 10:46:21,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:21,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:21,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:21,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 10:46:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-27 10:46:21,252 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-27 10:46:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:21,252 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-27 10:46:21,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:46:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-27 10:46:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 10:46:21,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:46:21,253 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:46:21,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:46:21,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:46:21,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:46:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2022-04-27 10:46:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:46:21,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434559287] [2022-04-27 10:46:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:46:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:46:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1188#true} is VALID [2022-04-27 10:46:21,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1188#true} {1188#true} #156#return; {1188#true} is VALID [2022-04-27 10:46:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 10:46:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #128#return; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 10:46:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #130#return; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:46:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} #132#return; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:46:21,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1188#true} is VALID [2022-04-27 10:46:21,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #156#return; {1188#true} is VALID [2022-04-27 10:46:21,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret11 := main(); {1188#true} is VALID [2022-04-27 10:46:21,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1188#true} is VALID [2022-04-27 10:46:21,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} assume ~tagbuf_len~0 >= 1; {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:21,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !false; {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:21,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #128#return; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,383 INFO L272 TraceCheckUtils]: 16: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:21,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,383 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #130#return; {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume !false; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} assume 0 != #t~nondet3;havoc #t~nondet3; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,385 INFO L272 TraceCheckUtils]: 25: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:21,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:21,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:21,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:21,386 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} #132#return; {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-27 10:46:21,386 INFO L272 TraceCheckUtils]: 30: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:46:21,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {1209#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:46:21,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {1210#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1189#false} is VALID [2022-04-27 10:46:21,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-27 10:46:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:46:21,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:46:21,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434559287] [2022-04-27 10:46:21,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434559287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:46:21,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412954331] [2022-04-27 10:46:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:46:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:46:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:46:21,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:46:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:46:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:46:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:46:21,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:46:22,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-27 10:46:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1188#true} is VALID [2022-04-27 10:46:22,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #156#return; {1188#true} is VALID [2022-04-27 10:46:22,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret11 := main(); {1188#true} is VALID [2022-04-27 10:46:22,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1188#true} is VALID [2022-04-27 10:46:22,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} assume ~tagbuf_len~0 >= 1; {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-27 10:46:22,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !false; {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-27 10:46:22,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 10:46:22,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 10:46:22,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #128#return; {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 10:46:22,028 INFO L272 TraceCheckUtils]: 16: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,028 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #130#return; {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-27 10:46:22,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 10:46:22,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !false; {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 10:46:22,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 10:46:22,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} assume 0 != #t~nondet3;havoc #t~nondet3; {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 10:46:22,030 INFO L272 TraceCheckUtils]: 25: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,031 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} #132#return; {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-27 10:46:22,032 INFO L272 TraceCheckUtils]: 30: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:46:22,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:46:22,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-27 10:46:22,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-27 10:46:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:46:22,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:46:22,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-27 10:46:22,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-27 10:46:22,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:46:22,208 INFO L272 TraceCheckUtils]: 30: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:46:22,208 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1328#(<= main_~t~0 main_~tagbuf_len~0)} #132#return; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,209 INFO L272 TraceCheckUtils]: 25: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0;~t~0 := 1 + #t~post4;havoc #t~post4; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,210 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #130#return; {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L272 TraceCheckUtils]: 16: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #128#return; {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-27 10:46:22,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-27 10:46:22,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1188#true} is VALID [2022-04-27 10:46:22,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} assume ~tagbuf_len~0 >= 1; {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-27 10:46:22,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1188#true} is VALID [2022-04-27 10:46:22,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret11 := main(); {1188#true} is VALID [2022-04-27 10:46:22,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #156#return; {1188#true} is VALID [2022-04-27 10:46:22,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-27 10:46:22,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1188#true} is VALID [2022-04-27 10:46:22,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-27 10:46:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 10:46:22,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412954331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:46:22,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:46:22,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-27 10:46:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370770903] [2022-04-27 10:46:22,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:46:22,215 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-27 10:46:22,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:46:22,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 10:46:22,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:22,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:46:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:46:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:46:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:46:22,254 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 10:46:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:23,362 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2022-04-27 10:46:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:46:23,362 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-27 10:46:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:46:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 10:46:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-27 10:46:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 10:46:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-27 10:46:23,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 101 transitions. [2022-04-27 10:46:23,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:46:23,461 INFO L225 Difference]: With dead ends: 80 [2022-04-27 10:46:23,461 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:46:23,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:46:23,462 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 103 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:46:23,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 66 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:46:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:46:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:46:23,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:46:23,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:46:23,463 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:46:23,463 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:46:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:23,463 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:23,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:46:23,464 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:46:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:46:23,464 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:46:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:46:23,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:46:23,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:46:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:46:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:46:23,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-27 10:46:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:46:23,464 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:46:23,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 10:46:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:46:23,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:46:23,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:46:23,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:46:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:46:23,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:46:23,947 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,948 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 77) no Hoare annotation was computed. [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,948 INFO L895 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L902 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 68) no Hoare annotation was computed. [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,949 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,950 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 77) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,950 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-27 10:46:23,950 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:46:23,950 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:46:23,950 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:46:23,950 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:46:23,951 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:46:23,951 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:46:23,951 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:46:23,953 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 10:46:23,954 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:46:23,956 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:46:23,956 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:46:23,956 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:23,961 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:46:23,962 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:46:23,962 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:46:23,962 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:46:23,962 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:46:23,962 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:46:23,963 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:46:23,964 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:46:23,965 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 10:46:23,967 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 10:46:23,968 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 10:46:23,968 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 10:46:23,968 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 10:46:23,968 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 10:46:23,968 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:46:23,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:46:23 BoogieIcfgContainer [2022-04-27 10:46:23,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:46:23,976 INFO L158 Benchmark]: Toolchain (without parser) took 6160.57ms. Allocated memory was 195.0MB in the beginning and 296.7MB in the end (delta: 101.7MB). Free memory was 142.1MB in the beginning and 161.6MB in the end (delta: -19.5MB). Peak memory consumption was 83.1MB. Max. memory is 8.0GB. [2022-04-27 10:46:23,976 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:46:23,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.71ms. Allocated memory is still 195.0MB. Free memory was 141.9MB in the beginning and 165.7MB in the end (delta: -23.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-27 10:46:23,977 INFO L158 Benchmark]: Boogie Preprocessor took 20.79ms. Allocated memory is still 195.0MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:46:23,977 INFO L158 Benchmark]: RCFGBuilder took 266.79ms. Allocated memory is still 195.0MB. Free memory was 164.1MB in the beginning and 149.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 10:46:23,977 INFO L158 Benchmark]: TraceAbstraction took 5682.38ms. Allocated memory was 195.0MB in the beginning and 296.7MB in the end (delta: 101.7MB). Free memory was 148.3MB in the beginning and 161.6MB in the end (delta: -13.2MB). Peak memory consumption was 89.5MB. Max. memory is 8.0GB. [2022-04-27 10:46:23,981 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 195.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.71ms. Allocated memory is still 195.0MB. Free memory was 141.9MB in the beginning and 165.7MB in the end (delta: -23.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.79ms. Allocated memory is still 195.0MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 266.79ms. Allocated memory is still 195.0MB. Free memory was 164.1MB in the beginning and 149.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5682.38ms. Allocated memory was 195.0MB in the beginning and 296.7MB in the end (delta: 101.7MB). Free memory was 148.3MB in the beginning and 161.6MB in the end (delta: -13.2MB). Peak memory consumption was 89.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 199 mSDtfsCounter, 963 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.3s 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: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 69 PreInvPairs, 105 NumberOfFragments, 161 HoareAnnotationTreeSize, 69 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 445 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s 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 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (1 <= tagbuf_len && t <= tagbuf_len) && 0 <= t RESULT: Ultimate proved your program to be correct! [2022-04-27 10:46:24,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...