/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:53:02,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:53:02,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:53:02,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:53:02,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:53:02,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:53:02,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:53:02,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:53:02,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:53:02,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:53:02,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:53:02,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:53:02,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:53:02,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:53:02,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:53:02,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:53:02,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:53:02,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:53:02,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:53:02,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:53:02,260 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:53:02,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:53:02,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:53:02,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:53:02,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:53:02,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:53:02,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:53:02,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:53:02,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:53:02,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:53:02,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:53:02,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:53:02,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:53:02,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:53:02,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:53:02,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:53:02,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:53:02,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:53:02,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:53:02,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:53:02,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:53:02,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:53:02,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:53:02,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:53:02,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:53:02,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:53:02,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:53:02,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:53:02,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:02,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:53:02,294 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:53:02,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:53:02,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:53:02,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:53:02,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:53:02,480 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:53:02,481 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-08 03:53:02,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4a3a05/3dcd9836a2dc48988506e47910b5e1fd/FLAGc8a07dce3 [2022-04-08 03:53:02,905 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:53:02,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-08 03:53:02,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4a3a05/3dcd9836a2dc48988506e47910b5e1fd/FLAGc8a07dce3 [2022-04-08 03:53:02,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4a3a05/3dcd9836a2dc48988506e47910b5e1fd [2022-04-08 03:53:02,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:53:02,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:53:02,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:02,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:53:02,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:53:02,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:02" (1/1) ... [2022-04-08 03:53:02,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e98654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:02, skipping insertion in model container [2022-04-08 03:53:02,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:02" (1/1) ... [2022-04-08 03:53:02,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:53:02,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:53:03,049 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-08 03:53:03,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:03,074 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:53:03,081 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-08 03:53:03,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:03,095 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:53:03,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03 WrapperNode [2022-04-08 03:53:03,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:03,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:53:03,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:53:03,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:53:03,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:53:03,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:53:03,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:53:03,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:53:03,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (1/1) ... [2022-04-08 03:53:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:53:03,156 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-08 03:53:03,169 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-08 03:53:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:53:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:53:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:53:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:53:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:53:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:53:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:53:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:53:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:53:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:53:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:53:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:53:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:53:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:53:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:53:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:53:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:53:03,235 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:53:03,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:53:03,409 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:53:03,418 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:53:03,418 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:53:03,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:03 BoogieIcfgContainer [2022-04-08 03:53:03,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:53:03,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:53:03,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:53:03,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:53:03,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:53:02" (1/3) ... [2022-04-08 03:53:03,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d71db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:03, skipping insertion in model container [2022-04-08 03:53:03,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:03" (2/3) ... [2022-04-08 03:53:03,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d71db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:03, skipping insertion in model container [2022-04-08 03:53:03,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:03" (3/3) ... [2022-04-08 03:53:03,424 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-04-08 03:53:03,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:53:03,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:53:03,471 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:53:03,476 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:53:03,476 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:53:03,500 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-08 03:53:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:53:03,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:03,505 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:03,505 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2022-04-08 03:53:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:03,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337643719] [2022-04-08 03:53:03,528 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 2 times [2022-04-08 03:53:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:03,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838098696] [2022-04-08 03:53:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:03,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:03,693 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-08 03:53:03,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 03:53:03,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-08 03:53:03,696 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-08 03:53:03,696 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-08 03:53:03,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 03:53:03,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #156#return; {51#true} is VALID [2022-04-08 03:53:03,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret11 := main(); {51#true} is VALID [2022-04-08 03:53:03,697 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-08 03:53:03,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume ~tagbuf_len~0 >= 1; {51#true} is VALID [2022-04-08 03:53:03,698 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-08 03:53:03,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-04-08 03:53:03,698 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-08 03:53:03,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2022-04-08 03:53:03,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2022-04-08 03:53:03,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-08 03:53:03,699 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-08 03:53:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:03,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838098696] [2022-04-08 03:53:03,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838098696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:03,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:03,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:53:03,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337643719] [2022-04-08 03:53:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337643719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:03,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:03,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:53:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086291384] [2022-04-08 03:53:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:03,707 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-08 03:53:03,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:03,711 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-08 03:53:03,738 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-08 03:53:03,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:53:03,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:53:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:53:03,761 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-08 03:53:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:03,987 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-04-08 03:53:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:53:03,987 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-08 03:53:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:03,989 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-08 03:53:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-08 03:53:04,007 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-08 03:53:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-08 03:53:04,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-04-08 03:53:04,173 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-08 03:53:04,183 INFO L225 Difference]: With dead ends: 88 [2022-04-08 03:53:04,183 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 03:53:04,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:53:04,188 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:04,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:53:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 03:53:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 03:53:04,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:04,214 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-08 03:53:04,215 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-08 03:53:04,215 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-08 03:53:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:04,219 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-08 03:53:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-08 03:53:04,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:04,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:04,229 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-08 03:53:04,229 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-08 03:53:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:04,232 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-08 03:53:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-08 03:53:04,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:04,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:04,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:04,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:04,234 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-08 03:53:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-08 03:53:04,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-08 03:53:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:04,237 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-08 03:53:04,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:04,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-08 03:53:04,295 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-08 03:53:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-08 03:53:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:53:04,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:04,296 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:04,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:53:04,296 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2022-04-08 03:53:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125511189] [2022-04-08 03:53:04,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 2 times [2022-04-08 03:53:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:04,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882820154] [2022-04-08 03:53:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:04,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#(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); {407#true} is VALID [2022-04-08 03:53:04,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-08 03:53:04,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-08 03:53:04,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:04,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(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); {407#true} is VALID [2022-04-08 03:53:04,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-08 03:53:04,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #156#return; {407#true} is VALID [2022-04-08 03:53:04,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret11 := main(); {407#true} is VALID [2022-04-08 03:53:04,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {407#true} is VALID [2022-04-08 03:53:04,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume ~tagbuf_len~0 >= 1; {407#true} is VALID [2022-04-08 03:53:04,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {412#(<= 0 main_~t~0)} is VALID [2022-04-08 03:53:04,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= 0 main_~t~0)} assume !false; {412#(<= 0 main_~t~0)} is VALID [2022-04-08 03:53:04,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {412#(<= 0 main_~t~0)} is VALID [2022-04-08 03:53:04,382 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {413#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:04,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {414#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:04,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {408#false} is VALID [2022-04-08 03:53:04,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-08 03:53:04,384 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-08 03:53:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:04,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882820154] [2022-04-08 03:53:04,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882820154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:04,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:04,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:04,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:04,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125511189] [2022-04-08 03:53:04,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125511189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:04,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:04,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152160829] [2022-04-08 03:53:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:04,386 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-08 03:53:04,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:04,386 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-08 03:53:04,395 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-08 03:53:04,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:04,397 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-08 03:53:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:04,784 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-08 03:53:04,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:04,784 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-08 03:53:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:04,784 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-08 03:53:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-08 03:53:04,786 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-08 03:53:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-08 03:53:04,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-08 03:53:04,842 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-08 03:53:04,844 INFO L225 Difference]: With dead ends: 49 [2022-04-08 03:53:04,844 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 03:53:04,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:53:04,845 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:04,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 03:53:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 03:53:04,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:04,864 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-08 03:53:04,865 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-08 03:53:04,865 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-08 03:53:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:04,867 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-08 03:53:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-08 03:53:04,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:04,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:04,868 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-08 03:53:04,869 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-08 03:53:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:04,871 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-08 03:53:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-08 03:53:04,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:04,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:04,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:04,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:04,872 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-08 03:53:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-08 03:53:04,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-08 03:53:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:04,874 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-08 03:53:04,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:04,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-08 03:53:04,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-08 03:53:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 03:53:04,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:04,927 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:04,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:53:04,927 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2022-04-08 03:53:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324240722] [2022-04-08 03:53:04,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 2 times [2022-04-08 03:53:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:04,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530894842] [2022-04-08 03:53:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#(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); {712#true} is VALID [2022-04-08 03:53:05,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 03:53:05,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-08 03:53:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 03:53:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-08 03:53:05,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-08 03:53:05,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 03:53:05,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {718#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-08 03:53:05,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:05,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#(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); {712#true} is VALID [2022-04-08 03:53:05,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 03:53:05,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #156#return; {712#true} is VALID [2022-04-08 03:53:05,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret11 := main(); {712#true} is VALID [2022-04-08 03:53:05,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {712#true} is VALID [2022-04-08 03:53:05,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#true} assume ~tagbuf_len~0 >= 1; {712#true} is VALID [2022-04-08 03:53:05,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} assume ~t~0 == ~tagbuf_len~0; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-08 03:53:05,036 INFO L272 TraceCheckUtils]: 10: Hoare triple {718#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {712#true} is VALID [2022-04-08 03:53:05,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-08 03:53:05,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-08 03:53:05,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-08 03:53:05,037 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {712#true} {718#(<= main_~t~0 main_~tagbuf_len~0)} #124#return; {718#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-08 03:53:05,037 INFO L272 TraceCheckUtils]: 15: Hoare triple {718#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:05,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {724#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:05,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {713#false} is VALID [2022-04-08 03:53:05,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-08 03:53:05,039 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-08 03:53:05,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:05,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530894842] [2022-04-08 03:53:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530894842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:05,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:05,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:05,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:05,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324240722] [2022-04-08 03:53:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324240722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:05,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:05,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418265681] [2022-04-08 03:53:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:05,040 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-08 03:53:05,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:05,040 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-08 03:53:05,051 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-08 03:53:05,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:05,052 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-08 03:53:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:05,663 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-08 03:53:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:05,663 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-08 03:53:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:05,663 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-08 03:53:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-08 03:53:05,665 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-08 03:53:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-08 03:53:05,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-08 03:53:05,740 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-08 03:53:05,742 INFO L225 Difference]: With dead ends: 62 [2022-04-08 03:53:05,742 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 03:53:05,743 INFO L912 BasicCegarLoop]: 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-08 03:53:05,745 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 03:53:05,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:53:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 03:53:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-08 03:53:05,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:05,774 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-08 03:53:05,775 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-08 03:53:05,775 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-08 03:53:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:05,781 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 03:53:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 03:53:05,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:05,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:05,785 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-08 03:53:05,786 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-08 03:53:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:05,790 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 03:53:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 03:53:05,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:05,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:05,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:05,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:05,791 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-08 03:53:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-08 03:53:05,793 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-08 03:53:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:05,793 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-08 03:53:05,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:05,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 52 transitions. [2022-04-08 03:53:05,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-08 03:53:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:53:05,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:05,833 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:05,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:53:05,833 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2022-04-08 03:53:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [596690177] [2022-04-08 03:53:05,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 2 times [2022-04-08 03:53:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203096424] [2022-04-08 03:53:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {1057#(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); {1044#true} is VALID [2022-04-08 03:53:05,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-08 03:53:05,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-08 03:53:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 03:53:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:05,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-08 03:53:05,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-08 03:53:05,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-08 03:53:05,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:05,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#(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); {1044#true} is VALID [2022-04-08 03:53:05,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-08 03:53:05,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #156#return; {1044#true} is VALID [2022-04-08 03:53:05,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret11 := main(); {1044#true} is VALID [2022-04-08 03:53:05,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1044#true} is VALID [2022-04-08 03:53:05,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#true} assume ~tagbuf_len~0 >= 1; {1049#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-08 03:53:05,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !false; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} assume 0 != #t~nondet3;havoc #t~nondet3; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1044#true} is VALID [2022-04-08 03:53:05,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#true} ~cond := #in~cond; {1044#true} is VALID [2022-04-08 03:53:05,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#true} assume !(0 == ~cond); {1044#true} is VALID [2022-04-08 03:53:05,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#true} assume true; {1044#true} is VALID [2022-04-08 03:53:05,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1044#true} {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} #132#return; {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-08 03:53:05,919 INFO L272 TraceCheckUtils]: 16: Hoare triple {1050#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1055#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:53:05,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {1055#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1056#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:53:05,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1056#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1045#false} is VALID [2022-04-08 03:53:05,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2022-04-08 03:53:05,920 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-08 03:53:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:05,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203096424] [2022-04-08 03:53:05,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203096424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:05,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:05,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:05,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:05,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [596690177] [2022-04-08 03:53:05,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [596690177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:05,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:05,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110347748] [2022-04-08 03:53:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:05,921 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-08 03:53:05,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:05,922 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-08 03:53:05,933 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-08 03:53:05,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:05,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:05,934 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-08 03:53:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:06,378 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-08 03:53:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:53:06,378 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-08 03:53:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:06,379 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-08 03:53:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-08 03:53:06,380 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-08 03:53:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-08 03:53:06,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-08 03:53:06,434 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-08 03:53:06,435 INFO L225 Difference]: With dead ends: 60 [2022-04-08 03:53:06,435 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 03:53:06,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:53:06,436 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:06,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:53:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 03:53:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-08 03:53:06,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:06,472 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-08 03:53:06,472 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-08 03:53:06,472 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-08 03:53:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:06,474 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-08 03:53:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-08 03:53:06,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:06,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:06,475 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-08 03:53:06,475 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-08 03:53:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:06,476 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-08 03:53:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-08 03:53:06,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:06,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:06,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:06,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:06,477 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-08 03:53:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-08 03:53:06,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-08 03:53:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:06,479 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-08 03:53:06,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:06,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-08 03:53:06,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-08 03:53:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 03:53:06,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:06,536 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:06,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:53:06,536 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2022-04-08 03:53:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:06,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252022332] [2022-04-08 03:53:07,513 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 03:53:07,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:53:07,705 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:53:07,708 INFO L158 Benchmark]: Toolchain (without parser) took 4784.55ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 141.0MB in the beginning and 193.6MB in the end (delta: -52.6MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-04-08 03:53:07,708 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory was 157.3MB in the beginning and 157.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:53:07,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.73ms. Allocated memory is still 190.8MB. Free memory was 140.8MB in the beginning and 166.0MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:53:07,709 INFO L158 Benchmark]: Boogie Preprocessor took 35.11ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 164.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:53:07,711 INFO L158 Benchmark]: RCFGBuilder took 288.04ms. Allocated memory is still 190.8MB. Free memory was 164.5MB in the beginning and 149.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 03:53:07,711 INFO L158 Benchmark]: TraceAbstraction took 4286.24ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 149.6MB in the beginning and 193.6MB in the end (delta: -44.0MB). Peak memory consumption was 120.9MB. Max. memory is 8.0GB. [2022-04-08 03:53:07,712 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.10ms. Allocated memory is still 190.8MB. Free memory was 157.3MB in the beginning and 157.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.73ms. Allocated memory is still 190.8MB. Free memory was 140.8MB in the beginning and 166.0MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.11ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 164.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 288.04ms. Allocated memory is still 190.8MB. Free memory was 164.5MB in the beginning and 149.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4286.24ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 149.6MB in the beginning and 193.6MB in the end (delta: -44.0MB). Peak memory consumption was 120.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:53:07,749 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...