./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a2f1dacf23e701c88af5ee644fdcccaa723983d694e8bd4147c38940002aa7b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:42:08,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:42:08,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:42:08,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:42:08,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:42:08,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:42:08,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:42:08,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:42:08,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:42:08,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:42:08,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:42:08,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:42:08,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:42:08,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:42:08,549 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:42:08,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:42:08,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:42:08,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:08,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:08,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:08,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:42:08,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:42:08,552 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-jdk21/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 -> a2f1dacf23e701c88af5ee644fdcccaa723983d694e8bd4147c38940002aa7b2 [2025-01-10 01:42:08,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:42:08,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:42:08,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:42:08,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:42:08,794 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:42:08,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i [2025-01-10 01:42:10,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a0e5657/14f802131e254c21999cddb2f0016eb6/FLAG8a7d9d228 [2025-01-10 01:42:10,275 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:42:10,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i [2025-01-10 01:42:10,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a0e5657/14f802131e254c21999cddb2f0016eb6/FLAG8a7d9d228 [2025-01-10 01:42:10,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a0e5657/14f802131e254c21999cddb2f0016eb6 [2025-01-10 01:42:10,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:42:10,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:42:10,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:10,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:42:10,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:42:10,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7241e271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10, skipping insertion in model container [2025-01-10 01:42:10,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:42:10,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:10,435 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:42:10,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:10,455 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:42:10,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10 WrapperNode [2025-01-10 01:42:10,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:10,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:10,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:42:10,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:42:10,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,477 INFO L138 Inliner]: procedures = 12, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-01-10 01:42:10,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:10,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:42:10,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:42:10,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:42:10,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,495 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [5, 3, 5]. 38 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [3, 1, 3]. [2025-01-10 01:42:10,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:42:10,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:42:10,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:42:10,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:42:10,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (1/1) ... [2025-01-10 01:42:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:10,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:42:10,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:42:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:42:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:42:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:42:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:42:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-10 01:42:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-01-10 01:42:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:42:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:42:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:42:10,710 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:42:10,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:42:10,945 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-10 01:42:10,945 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:42:10,952 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:42:10,952 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:42:10,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:10 BoogieIcfgContainer [2025-01-10 01:42:10,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:42:10,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:42:10,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:42:10,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:42:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:10" (1/3) ... [2025-01-10 01:42:10,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573de60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:10, skipping insertion in model container [2025-01-10 01:42:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:10" (2/3) ... [2025-01-10 01:42:10,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573de60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:10, skipping insertion in model container [2025-01-10 01:42:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:10" (3/3) ... [2025-01-10 01:42:10,959 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex5B.i [2025-01-10 01:42:10,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:42:10,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_malloc_ex5B.i that has 3 procedures, 43 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-01-10 01:42:11,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:42:11,018 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;@7d64d951, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:42:11,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:42:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:42:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:42:11,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:11,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:11,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:42:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1609417504, now seen corresponding path program 1 times [2025-01-10 01:42:11,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105258920] [2025-01-10 01:42:11,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:42:11,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:42:11,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105258920] [2025-01-10 01:42:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105258920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856584050] [2025-01-10 01:42:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:11,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:11,216 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:42:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:11,254 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-01-10 01:42:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2025-01-10 01:42:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:11,261 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:42:11,261 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 01:42:11,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:11,269 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:11,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 01:42:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-10 01:42:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-01-10 01:42:11,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 8 [2025-01-10 01:42:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:11,304 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-10 01:42:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:42:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-01-10 01:42:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:42:11,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:11,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:42:11,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:42:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1666675806, now seen corresponding path program 1 times [2025-01-10 01:42:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685782090] [2025-01-10 01:42:11,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:11,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:42:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:42:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:11,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685782090] [2025-01-10 01:42:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685782090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473136056] [2025-01-10 01:42:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:11,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:11,375 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:42:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:11,404 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-10 01:42:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:11,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2025-01-10 01:42:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:11,406 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:42:11,406 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:42:11,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:11,407 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:11,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:42:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:42:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-01-10 01:42:11,414 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 8 [2025-01-10 01:42:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:11,414 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-01-10 01:42:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-01-10 01:42:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-01-10 01:42:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:42:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:11,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:42:11,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-01-10 01:42:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 127342472, now seen corresponding path program 1 times [2025-01-10 01:42:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992252318] [2025-01-10 01:42:11,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:11,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:42:11,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:42:11,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:11,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:42:11,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:42:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:42:11,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:42:11,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:11,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:42:11,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:42:11,482 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:42:11,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 01:42:11,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 01:42:11,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 01:42:11,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 01:42:11,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 01:42:11,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 01:42:11,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 01:42:11,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 01:42:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:42:11,488 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 01:42:11,502 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:42:11,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:42:11 BoogieIcfgContainer [2025-01-10 01:42:11,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:42:11,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:42:11,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:42:11,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:42:11,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:10" (3/4) ... [2025-01-10 01:42:11,506 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:42:11,530 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-01-10 01:42:11,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:42:11,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:42:11,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:42:11,557 INFO L158 Benchmark]: Toolchain (without parser) took 1245.26ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 44.6MB in the end (delta: 67.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 01:42:11,558 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:11,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:11,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.95ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 997.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:11,558 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:11,558 INFO L158 Benchmark]: RCFGBuilder took 429.49ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:42:11,559 INFO L158 Benchmark]: TraceAbstraction took 549.90ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 49.5MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:42:11,559 INFO L158 Benchmark]: Witness Printer took 52.17ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 44.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:11,560 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.21ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.95ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 997.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 429.49ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 549.90ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 49.5MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 52.17ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 44.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. 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: 23]: integer overflow possible integer overflow possible We found a FailurePath: [L69] int *p1 = malloc(sizeof(int)); [L70] int *p2 = malloc(sizeof(int)); [L73] *p1 = __VERIFIER_nondet_int() [L74] *p2 = __VERIFIER_nondet_int() [L76] EXPR \read(*p1) [L76] *p1 < 0 || *p2 < 0 VAL [p1={-2:0}, p2={-1:0}] [L76] *p1 < 0 || *p2 < 0 [L76] EXPR \read(*p2) [L76] *p1 < 0 || *p2 < 0 VAL [p1={-2:0}, p2={-1:0}] [L76] COND FALSE !(*p1 < 0 || *p2 < 0) [L79] EXPR \read(*p2) [L79] CALL f(p1,*p2) VAL [\old(q)={-2:0}, \old(v)=2147483647] [L17] COND FALSE !(v < 0) [L22] int *tmp = malloc(sizeof(int)); [L23] v+1 VAL [\old(q)={-2:0}, \old(v)=2147483647, tmp={-3:0}] - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: 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 3 procedures, 43 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 81 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-01-10 01:42:11,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)