./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-recursive-malloc/chunk3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-recursive-malloc/chunk3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 19fa5e5331bf5f5328e727d3adbf080a08b9ec2fa548b9c0eb2f35cc19738b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:58:27,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:58:27,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:58:27,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:58:27,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:58:27,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:58:27,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:58:27,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:58:27,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:58:27,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:58:27,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:58:27,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:58:27,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:58:27,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:27,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:58:27,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:58:27,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:58:27,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:58:27,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19fa5e5331bf5f5328e727d3adbf080a08b9ec2fa548b9c0eb2f35cc19738b3d [2025-03-17 14:58:27,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:58:27,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:58:27,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:58:27,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:58:27,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:58:27,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/chunk3.i [2025-03-17 14:58:28,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3871028b/14113b3204894dcc9b51119670af03de/FLAG686b78ebf [2025-03-17 14:58:28,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:58:28,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/chunk3.i [2025-03-17 14:58:28,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3871028b/14113b3204894dcc9b51119670af03de/FLAG686b78ebf [2025-03-17 14:58:28,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3871028b/14113b3204894dcc9b51119670af03de [2025-03-17 14:58:28,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:58:28,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:58:28,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:28,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:58:28,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:58:28,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:28" (1/1) ... [2025-03-17 14:58:28,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e582c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:28, skipping insertion in model container [2025-03-17 14:58:28,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:28" (1/1) ... [2025-03-17 14:58:28,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:58:29,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:29,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:58:29,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:58:29,106 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:58:29,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29 WrapperNode [2025-03-17 14:58:29,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:58:29,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:29,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:58:29,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:58:29,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,135 INFO L138 Inliner]: procedures = 13, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-17 14:58:29,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:58:29,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:58:29,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:58:29,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:58:29,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,161 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [8, 14]. 64 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 11 writes are split as follows [4, 7]. [2025-03-17 14:58:29,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:58:29,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:58:29,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:58:29,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:58:29,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (1/1) ... [2025-03-17 14:58:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:58:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:29,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:58:29,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure chunk [2025-03-17 14:58:29,233 INFO L138 BoogieDeclarations]: Found implementation of procedure chunk [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:58:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:58:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:58:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:58:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:58:29,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:58:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:58:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:58:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:58:29,292 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:58:29,293 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:58:29,455 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 14:58:29,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:58:29,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:58:29,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:58:29,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:29 BoogieIcfgContainer [2025-03-17 14:58:29,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:58:29,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:58:29,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:58:29,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:58:29,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:28" (1/3) ... [2025-03-17 14:58:29,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159567e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:29, skipping insertion in model container [2025-03-17 14:58:29,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:29" (2/3) ... [2025-03-17 14:58:29,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159567e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:29, skipping insertion in model container [2025-03-17 14:58:29,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:29" (3/3) ... [2025-03-17 14:58:29,471 INFO L128 eAbstractionObserver]: Analyzing ICFG chunk3.i [2025-03-17 14:58:29,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:58:29,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chunk3.i that has 2 procedures, 17 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-17 14:58:29,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:58:29,530 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3324b206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:58:29,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 14:58:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:58:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:58:29,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:29,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:58:29,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:58:29,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1478358478, now seen corresponding path program 1 times [2025-03-17 14:58:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837083529] [2025-03-17 14:58:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:29,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:58:29,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:58:29,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:29,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837083529] [2025-03-17 14:58:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837083529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:58:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771554733] [2025-03-17 14:58:30,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:30,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:58:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:58:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:30,341 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:30,507 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-17 14:58:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:58:30,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:58:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:30,512 INFO L225 Difference]: With dead ends: 26 [2025-03-17 14:58:30,512 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 14:58:30,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:30,517 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:30,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 53 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 14:58:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-17 14:58:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 14:58:30,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2025-03-17 14:58:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:30,545 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 14:58:30,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 14:58:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:58:30,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:30,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:30,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:58:30,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:58:30,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1415527466, now seen corresponding path program 1 times [2025-03-17 14:58:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259067021] [2025-03-17 14:58:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:30,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:58:30,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:58:30,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:30,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259067021] [2025-03-17 14:58:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259067021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:58:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:58:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:58:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116601125] [2025-03-17 14:58:30,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:58:30,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:58:30,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:30,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:58:30,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:58:30,932 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:31,018 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-17 14:58:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:58:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:58:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:31,020 INFO L225 Difference]: With dead ends: 15 [2025-03-17 14:58:31,020 INFO L226 Difference]: Without dead ends: 14 [2025-03-17 14:58:31,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:58:31,023 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:58:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-17 14:58:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 14:58:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 14:58:31,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-17 14:58:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 14:58:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 14:58:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:58:31,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:31,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:58:31,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:58:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1555367899, now seen corresponding path program 1 times [2025-03-17 14:58:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300411587] [2025-03-17 14:58:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:58:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:58:31,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:58:31,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300411587] [2025-03-17 14:58:31,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300411587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:58:31,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769815092] [2025-03-17 14:58:31,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:58:31,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:58:31,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:58:31,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:58:31,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:58:31,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:31,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:58:31,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-17 14:58:31,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:58:31,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62118 treesize of output 61094 [2025-03-17 14:58:32,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2025-03-17 14:58:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 1 [2025-03-17 14:58:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:58:32,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 1 [2025-03-17 14:58:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-17 14:58:32,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:32,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 117 [2025-03-17 14:58:32,692 INFO L349 Elim1Store]: treesize reduction 63, result has 30.8 percent of original size [2025-03-17 14:58:32,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 171 [2025-03-17 14:58:32,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 36 [2025-03-17 14:58:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-17 14:58:32,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 14:58:32,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:32,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 84 [2025-03-17 14:58:32,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:58:32,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 34 [2025-03-17 14:58:32,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:32,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 17 [2025-03-17 14:58:33,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 129 [2025-03-17 14:58:33,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:33,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 273 treesize of output 265 [2025-03-17 14:58:33,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2025-03-17 14:58:33,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2025-03-17 14:58:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:33,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:58:34,019 INFO L349 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2025-03-17 14:58:34,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 567 treesize of output 432 [2025-03-17 14:58:34,055 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2025-03-17 14:58:34,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 159 [2025-03-17 14:58:34,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:34,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 162 [2025-03-17 14:58:34,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:34,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2025-03-17 14:58:34,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2025-03-17 14:58:34,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 14:58:34,119 INFO L349 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2025-03-17 14:58:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 1 [2025-03-17 14:58:34,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2025-03-17 14:58:34,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:58:34,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 163 [2025-03-17 14:58:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:58:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769815092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:58:34,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:58:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2025-03-17 14:58:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102958683] [2025-03-17 14:58:34,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:58:34,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:58:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:58:34,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:58:34,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:58:34,274 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:58:35,839 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-03-17 14:58:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:58:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:58:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:58:35,840 INFO L225 Difference]: With dead ends: 20 [2025-03-17 14:58:35,840 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 14:58:35,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=1052, Unknown=1, NotChecked=0, Total=1260 [2025-03-17 14:58:35,841 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:58:35,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 21 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:58:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 14:58:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2025-03-17 14:58:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 14:58:35,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2025-03-17 14:58:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:58:35,844 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 14:58:35,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:58:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 14:58:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:58:35,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:58:35,845 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:58:35,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:58:36,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:58:36,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 14:58:36,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:58:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -971764641, now seen corresponding path program 1 times [2025-03-17 14:58:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:58:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243980965] [2025-03-17 14:58:36,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:58:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:58:36,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:58:36,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:58:36,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:58:36,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:58:36,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:58:36,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:58:36,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:58:36,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:58:36,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:58:36,101 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:58:36,102 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location chunkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-17 14:58:36,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location chunkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-17 14:58:36,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:58:36,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:58:36,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:58:36,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:58:36 BoogieIcfgContainer [2025-03-17 14:58:36,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:58:36,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:58:36,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:58:36,124 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:58:36,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:29" (3/4) ... [2025-03-17 14:58:36,125 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 14:58:36,161 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-17 14:58:36,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:58:36,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:58:36,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:58:36,192 INFO L158 Benchmark]: Toolchain (without parser) took 7252.23ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.0MB in the beginning and 195.3MB in the end (delta: -71.3MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2025-03-17 14:58:36,192 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:36,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.96ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:58:36,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.90ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:36,193 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:36,194 INFO L158 Benchmark]: IcfgBuilder took 281.71ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 94.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:58:36,194 INFO L158 Benchmark]: TraceAbstraction took 6658.50ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 94.1MB in the beginning and 199.3MB in the end (delta: -105.2MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2025-03-17 14:58:36,195 INFO L158 Benchmark]: Witness Printer took 67.71ms. Allocated memory is still 352.3MB. Free memory was 199.3MB in the beginning and 195.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:58:36,197 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.96ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.90ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 281.71ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 94.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6658.50ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 94.1MB in the beginning and 199.3MB in the end (delta: -105.2MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * Witness Printer took 67.71ms. Allocated memory is still 352.3MB. Free memory was 199.3MB in the beginning and 195.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: integer overflow possible integer overflow possible We found a FailurePath: [L32] int **data = malloc(4*sizeof(int*)); [L35] int *p0 = malloc(sizeof(int)); [L36] int *p1 = malloc(sizeof(int)); [L37] int *p2 = malloc(sizeof(int)); [L38] int *p3 = malloc(sizeof(int)); [L41] int i = __VERIFIER_nondet_int(); [L42] int upper = __VERIFIER_nondet_int(); [L44] COND FALSE !(i >= upper) [L47] *p0 = i [L48] *p3 = upper [L52] data[0] = p0 [L53] data[1] = p1 [L54] data[2] = p2 [L55] data[3] = p3 [L59] CALL chunk(data) VAL [\old(data)={-5:0}] [L9] EXPR data[0] [L9] int *p0 = data[0]; [L10] EXPR data[1] [L10] int *p1 = data[1]; [L11] EXPR data[2] [L11] int *p2 = data[2]; [L12] EXPR data[3] [L12] int *p3 = data[3]; [L14] EXPR \read(*p0) [L14] EXPR \read(*p3) VAL [\old(data)={-5:0}, data={-5:0}, p0={-3:0}, p2={-1:0}, p3={-2:0}] [L14] COND FALSE !(*p0 >= *p3) [L17] EXPR \read(*p0) [L17] (*p0)++ [L17] (*p0)++ [L19] EXPR \read(*p3) [L19] *p2 = *p3 [L21] data[1] = malloc(sizeof(int*)) [L22] EXPR data[1] [L22] data[2] = data[1] [L23] EXPR data[2] [L23] data[3] = data[2] [L25] CALL chunk(data) VAL [\old(data)={-5:0}] [L9] EXPR data[0] [L9] int *p0 = data[0]; [L10] EXPR data[1] [L10] int *p1 = data[1]; [L11] EXPR data[2] [L11] int *p2 = data[2]; [L12] EXPR data[3] [L12] int *p3 = data[3]; [L14] EXPR \read(*p0) [L14] EXPR \read(*p3) VAL [\old(data)={-5:0}, data={-5:0}, p0={-3:0}, p2={-6:0}, p3={-6:0}] [L14] COND FALSE !(*p0 >= *p3) [L17] EXPR \read(*p0) [L17] (*p0)++ VAL [\old(data)={-5:0}, data={-5:0}, p0={-3:0}, p2={-6:0}, p3={-6:0}] - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 21 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 219 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 18 mSDtfsCounter, 219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 41 ConstructedInterpolants, 8 QuantifiedInterpolants, 2048 SizeOfPredicates, 20 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 14:58:36,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)