/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/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:08:46,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:08:46,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:08:46,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:08:46,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:08:46,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:08:46,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:08:46,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:08:46,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:08:46,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:08:46,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:08:46,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:08:46,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:08:46,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:08:46,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:08:46,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:08:46,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:08:46,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:08:46,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:08:46,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:08:46,894 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:08:46,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:08:46,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:08:46,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:08:46,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:08:46,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:08:46,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:08:46,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:08:46,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:08:46,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:08:46,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:08:46,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:08:46,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:08:46,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:08:46,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:08:46,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:08:46,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:08:46,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:08:46,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:08:46,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:08:46,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:08:46,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:08:46,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:08:46,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:08:46,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:08:46,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:08:46,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:08:46,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:08:46,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:08:46,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:08:46,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:08:46,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:08:46,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:08:46,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:08:46,938 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:08:46,938 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:08:46,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:08:46,938 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:08:46,938 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-28 03:08:47,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:08:47,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:08:47,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:08:47,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:08:47,176 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:08:47,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-28 03:08:47,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9ed75b8/8f7078cc5ef3421a9ba9af51ee23352b/FLAG2d63da443 [2022-04-28 03:08:47,678 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:08:47,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-28 03:08:47,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9ed75b8/8f7078cc5ef3421a9ba9af51ee23352b/FLAG2d63da443 [2022-04-28 03:08:48,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9ed75b8/8f7078cc5ef3421a9ba9af51ee23352b [2022-04-28 03:08:48,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:08:48,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:08:48,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:08:48,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:08:48,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:08:48,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81811ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48, skipping insertion in model container [2022-04-28 03:08:48,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:08:48,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:08:48,258 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/MADWiFi-encode_ie_ok.i[893,906] [2022-04-28 03:08:48,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:08:48,294 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:08:48,305 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/MADWiFi-encode_ie_ok.i[893,906] [2022-04-28 03:08:48,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:08:48,320 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:08:48,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48 WrapperNode [2022-04-28 03:08:48,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:08:48,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:08:48,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:08:48,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:08:48,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:08:48,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:08:48,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:08:48,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:08:48,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (1/1) ... [2022-04-28 03:08:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:08:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:48,393 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-28 03:08:48,401 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-28 03:08:48,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:08:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:08:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:08:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:08:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:08:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:08:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:08:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:08:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:08:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:08:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:08:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:08:48,487 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:08:48,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:08:48,718 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:08:48,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:08:48,724 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:08:48,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:08:48 BoogieIcfgContainer [2022-04-28 03:08:48,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:08:48,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:08:48,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:08:48,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:08:48,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:08:48" (1/3) ... [2022-04-28 03:08:48,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222a4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:08:48, skipping insertion in model container [2022-04-28 03:08:48,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:48" (2/3) ... [2022-04-28 03:08:48,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222a4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:08:48, skipping insertion in model container [2022-04-28 03:08:48,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:08:48" (3/3) ... [2022-04-28 03:08:48,733 INFO L111 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2022-04-28 03:08:48,745 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:08:48,746 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:08:48,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:08:48,820 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18bd4ff3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c49a8b4 [2022-04-28 03:08:48,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:08:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:08:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:08:48,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:48,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:48,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1180455853, now seen corresponding path program 1 times [2022-04-28 03:08:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:48,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573973321] [2022-04-28 03:08:48,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:08:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1180455853, now seen corresponding path program 2 times [2022-04-28 03:08:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387350333] [2022-04-28 03:08:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:49,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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); {32#true} is VALID [2022-04-28 03:08:49,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 03:08:49,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-28 03:08:49,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:49,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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); {32#true} is VALID [2022-04-28 03:08:49,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 03:08:49,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #94#return; {32#true} is VALID [2022-04-28 03:08:49,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 03:08:49,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2022-04-28 03:08:49,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(~leader_len~0 < 1000000); {32#true} is VALID [2022-04-28 03:08:49,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(~bufsize~0 < 1000000); {32#true} is VALID [2022-04-28 03:08:49,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(~ielen~0 < 1000000); {32#true} is VALID [2022-04-28 03:08:49,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume ~leader_len~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 03:08:49,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= 1 main_~leader_len~0)} assume ~bufsize~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 03:08:49,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= 1 main_~leader_len~0)} assume ~ielen~0 > 0; {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-28 03:08:49,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= 1 main_~leader_len~0)} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {38#(<= 1 main_~p~0)} is VALID [2022-04-28 03:08:49,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(<= 1 main_~p~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {38#(<= 1 main_~p~0)} is VALID [2022-04-28 03:08:49,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(<= 1 main_~p~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {38#(<= 1 main_~p~0)} is VALID [2022-04-28 03:08:49,229 INFO L272 TraceCheckUtils]: 15: Hoare triple {38#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:08:49,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:49,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-28 03:08:49,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 03:08:49,232 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-28 03:08:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:49,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387350333] [2022-04-28 03:08:49,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387350333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:49,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:49,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:08:49,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:49,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573973321] [2022-04-28 03:08:49,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573973321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:49,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:49,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:08:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128041155] [2022-04-28 03:08:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-04-28 03:08:49,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:49,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-28 03:08:49,283 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-28 03:08:49,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:08:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:08:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:08:49,315 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-28 03:08:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:49,847 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-28 03:08:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:08:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-04-28 03:08:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-28 03:08:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 03:08:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-28 03:08:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 03:08:49,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 03:08:49,935 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-28 03:08:49,946 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:08:49,946 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:08:49,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:08:49,952 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:49,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:08:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:08:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:08:50,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:50,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:50,039 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:50,039 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,042 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:08:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:08:50,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 03:08:50,044 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 03:08:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,046 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:08:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:08:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:50,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 03:08:50,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2022-04-28 03:08:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:50,051 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 03:08:50,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-28 03:08:50,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 03:08:50,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:08:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:08:50,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:50,096 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:50,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:08:50,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash -107986180, now seen corresponding path program 1 times [2022-04-28 03:08:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448420206] [2022-04-28 03:08:50,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:08:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash -107986180, now seen corresponding path program 2 times [2022-04-28 03:08:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:50,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490635444] [2022-04-28 03:08:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:50,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(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); {274#true} is VALID [2022-04-28 03:08:50,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:08:50,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #94#return; {274#true} is VALID [2022-04-28 03:08:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-28 03:08:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:50,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-28 03:08:50,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-28 03:08:50,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:08:50,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #90#return; {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:50,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:50,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(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); {274#true} is VALID [2022-04-28 03:08:50,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:08:50,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #94#return; {274#true} is VALID [2022-04-28 03:08:50,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-28 03:08:50,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {274#true} is VALID [2022-04-28 03:08:50,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~leader_len~0 < 1000000); {274#true} is VALID [2022-04-28 03:08:50,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(~bufsize~0 < 1000000); {274#true} is VALID [2022-04-28 03:08:50,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !!(~ielen~0 < 1000000); {274#true} is VALID [2022-04-28 03:08:50,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume ~leader_len~0 > 0; {274#true} is VALID [2022-04-28 03:08:50,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#true} assume ~bufsize~0 > 0; {274#true} is VALID [2022-04-28 03:08:50,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#true} assume ~ielen~0 > 0; {274#true} is VALID [2022-04-28 03:08:50,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:50,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:50,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {279#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:50,290 INFO L272 TraceCheckUtils]: 15: Hoare triple {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {274#true} is VALID [2022-04-28 03:08:50,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-28 03:08:50,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-28 03:08:50,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:08:50,291 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {274#true} {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} #90#return; {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:50,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {280#(<= (+ main_~p~0 3) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {285#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:08:50,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {286#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:50,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-28 03:08:50,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-28 03:08:50,294 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-28 03:08:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490635444] [2022-04-28 03:08:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490635444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:50,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:08:50,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:50,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448420206] [2022-04-28 03:08:50,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448420206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:50,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:50,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:08:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674286249] [2022-04-28 03:08:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-28 03:08:50,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:50,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:08:50,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:08:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:08:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:08:50,326 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:08:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,713 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 03:08:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:08:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-28 03:08:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:08:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 03:08:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:08:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 03:08:50,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-28 03:08:50,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,754 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:08:50,754 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:08:50,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:08:50,756 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:50,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:08:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:08:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-28 03:08:50,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:50,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:08:50,779 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:08:50,779 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:08:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,782 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 03:08:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 03:08:50,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 03:08:50,784 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 03:08:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,789 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 03:08:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 03:08:50,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:50,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:08:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 03:08:50,796 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2022-04-28 03:08:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:50,797 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 03:08:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:08:50,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 03:08:50,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 03:08:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:08:50,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:50,841 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:08:50,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1340590469, now seen corresponding path program 1 times [2022-04-28 03:08:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:50,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1638268726] [2022-04-28 03:08:55,281 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:08:55,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:08:55,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash -391048618, now seen corresponding path program 1 times [2022-04-28 03:08:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:55,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051295094] [2022-04-28 03:08:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:55,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#(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); {524#true} is VALID [2022-04-28 03:08:55,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 03:08:55,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 03:08:55,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:08:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 03:08:55,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 03:08:55,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 03:08:55,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:55,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:55,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#(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); {524#true} is VALID [2022-04-28 03:08:55,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 03:08:55,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #94#return; {524#true} is VALID [2022-04-28 03:08:55,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2022-04-28 03:08:55,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} havoc ~p~0;havoc ~i~0;havoc ~leader_len~0;havoc ~bufsize~0;havoc ~bufsize_0~0;havoc ~ielen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~leader_len~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufsize~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~ielen~0 := #t~nondet3;havoc #t~nondet3; {524#true} is VALID [2022-04-28 03:08:55,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!(~leader_len~0 < 1000000); {524#true} is VALID [2022-04-28 03:08:55,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#true} assume !!(~bufsize~0 < 1000000); {524#true} is VALID [2022-04-28 03:08:55,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!(~ielen~0 < 1000000); {524#true} is VALID [2022-04-28 03:08:55,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#true} assume ~leader_len~0 > 0; {524#true} is VALID [2022-04-28 03:08:55,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#true} assume ~bufsize~0 > 0; {524#true} is VALID [2022-04-28 03:08:55,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#true} assume ~ielen~0 > 0; {524#true} is VALID [2022-04-28 03:08:55,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#true} assume !(~bufsize~0 < ~leader_len~0);~p~0 := 0;~bufsize_0~0 := ~bufsize~0;~bufsize~0 := ~bufsize~0 - ~leader_len~0;~p~0 := ~p~0 + ~leader_len~0; {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:55,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} assume !(~bufsize~0 < 2 * ~ielen~0);~i~0 := 0; {530#(and (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-28 03:08:55,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#(and (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [98] L49-3-->L50_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse3 (< 2 v_main_~bufsize~0_15)) (.cse4 (<= 0 v_main_~p~0_15)) (.cse1 (= v_main_~p~0_15 v_main_~p~0_14)) (.cse2 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 (= v_main_~bufsize_0~0_7 v_main_~bufsize_0~0_7) (= v_main_~ielen~0_12 v_main_~ielen~0_12) .cse1 .cse2 (= v_main_~bufsize~0_15 v_main_~bufsize~0_15)) (and (< v_main_~i~0_8 v_main_~i~0_7) (= (+ v_main_~p~0_14 (* v_main_~i~0_8 2)) (+ v_main_~p~0_15 (* v_main_~i~0_7 2))) .cse3 (< v_main_~i~0_7 (+ v_main_~i~0_8 2 (div (+ (* (- 1) v_main_~p~0_15) (- 2) v_main_~bufsize_0~0_7) 2))) .cse4 (< v_main_~i~0_7 (+ v_main_~ielen~0_12 1))) (and .cse0 (or (not (< (+ v_main_~p~0_15 1) v_main_~bufsize_0~0_7)) (not .cse3) (not .cse4) (not (< v_main_~i~0_8 v_main_~ielen~0_12))) .cse1 .cse2))) InVars {main_~ielen~0=v_main_~ielen~0_12, main_~i~0=v_main_~i~0_8, main_~bufsize_0~0=v_main_~bufsize_0~0_7, main_#t~post4=|v_main_#t~post4_4|, main_~bufsize~0=v_main_~bufsize~0_15, main_~p~0=v_main_~p~0_15} OutVars{main_~ielen~0=v_main_~ielen~0_12, main_#t~post4=|v_main_#t~post4_3|, main_~i~0=v_main_~i~0_7, main_~bufsize_0~0=v_main_~bufsize_0~0_7, main_~bufsize~0=v_main_~bufsize~0_15, main_~p~0=v_main_~p~0_14} AuxVars[] AssignedVars[main_#t~post4, main_~i~0, main_~p~0] {531#(or (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0))} is VALID [2022-04-28 03:08:55,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(or (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0))} [97] L50_primed-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~ielen~0=v_main_~ielen~0_11, main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14} OutVars{main_~ielen~0=v_main_~ielen~0_11, main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14} AuxVars[] AssignedVars[] {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:55,842 INFO L272 TraceCheckUtils]: 16: Hoare triple {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 0 <= ~p~0 then 1 else 0)); {524#true} is VALID [2022-04-28 03:08:55,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#true} ~cond := #in~cond; {524#true} is VALID [2022-04-28 03:08:55,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#true} assume !(0 == ~cond); {524#true} is VALID [2022-04-28 03:08:55,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#true} assume true; {524#true} is VALID [2022-04-28 03:08:55,844 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {524#true} {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} #90#return; {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-28 03:08:55,845 INFO L272 TraceCheckUtils]: 21: Hoare triple {532#(<= (+ main_~p~0 2) main_~bufsize_0~0)} call __VERIFIER_assert((if 1 + ~p~0 < ~bufsize_0~0 then 1 else 0)); {537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:08:55,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:55,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {525#false} is VALID [2022-04-28 03:08:55,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {525#false} assume !false; {525#false} is VALID [2022-04-28 03:08:55,848 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-28 03:08:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:55,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051295094] [2022-04-28 03:08:55,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051295094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:55,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:55,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:08:57,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1638268726] [2022-04-28 03:08:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1638268726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:08:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966277788] [2022-04-28 03:08:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-04-28 03:08:57,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:57,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:08:57,052 WARN L143 InductivityCheck]: Transition 550#(<= main_~p~0 main_~bufsize_0~0) ( _ , assume !!(~i~0 < ~ielen~0 && ~bufsize~0 > 2); , 532#(<= (+ main_~p~0 2) main_~bufsize_0~0) ) not inductive [2022-04-28 03:08:57,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:08:57,053 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 03:08:57,057 INFO L158 Benchmark]: Toolchain (without parser) took 8981.03ms. Allocated memory was 187.7MB in the beginning and 281.0MB in the end (delta: 93.3MB). Free memory was 137.6MB in the beginning and 142.6MB in the end (delta: -5.0MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. [2022-04-28 03:08:57,057 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:08:57,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.87ms. Allocated memory was 187.7MB in the beginning and 281.0MB in the end (delta: 93.3MB). Free memory was 137.4MB in the beginning and 256.4MB in the end (delta: -119.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-28 03:08:57,058 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 281.0MB. Free memory was 256.4MB in the beginning and 254.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:08:57,058 INFO L158 Benchmark]: RCFGBuilder took 372.16ms. Allocated memory is still 281.0MB. Free memory was 254.8MB in the beginning and 241.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:08:57,058 INFO L158 Benchmark]: TraceAbstraction took 8327.55ms. Allocated memory is still 281.0MB. Free memory was 241.2MB in the beginning and 142.6MB in the end (delta: 98.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-04-28 03:08:57,060 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.13ms. Allocated memory is still 187.7MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.87ms. Allocated memory was 187.7MB in the beginning and 281.0MB in the end (delta: 93.3MB). Free memory was 137.4MB in the beginning and 256.4MB in the end (delta: -119.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 281.0MB. Free memory was 256.4MB in the beginning and 254.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.16ms. Allocated memory is still 281.0MB. Free memory was 254.8MB in the beginning and 241.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8327.55ms. Allocated memory is still 281.0MB. Free memory was 241.2MB in the beginning and 142.6MB in the end (delta: 98.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:08:57,093 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...