./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/psyco/psyco_math_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/psyco/psyco_math_1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 63c09076012948d358ef22d7f5bfd1d18463c56506eb9759740cc4520130fa60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:36:52,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:36:52,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:36:52,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:36:52,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:36:52,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:36:52,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:36:52,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:36:52,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:36:52,540 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:36:52,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:36:52,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:36:52,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:36:52,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:36:52,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:36:52,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:36:52,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:52,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:52,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:36:52,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:36:52,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:36:52,544 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63c09076012948d358ef22d7f5bfd1d18463c56506eb9759740cc4520130fa60 [2025-01-10 01:36:52,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:36:52,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:36:52,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:36:52,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:36:52,732 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:36:52,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_math_1.c [2025-01-10 01:36:53,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bbabdf9b/fdf3b6c8a6bf47bf9e3b07a7b708bbbe/FLAG61d75d341 [2025-01-10 01:36:54,116 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:36:54,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_math_1.c [2025-01-10 01:36:54,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bbabdf9b/fdf3b6c8a6bf47bf9e3b07a7b708bbbe/FLAG61d75d341 [2025-01-10 01:36:54,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bbabdf9b/fdf3b6c8a6bf47bf9e3b07a7b708bbbe [2025-01-10 01:36:54,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:36:54,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:36:54,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:36:54,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:36:54,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:36:54,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402018cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54, skipping insertion in model container [2025-01-10 01:36:54,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:36:54,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:36:54,319 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:36:54,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:36:54,380 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:36:54,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54 WrapperNode [2025-01-10 01:36:54,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:36:54,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:36:54,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:36:54,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:36:54,391 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:36:54" (1/1) ... [2025-01-10 01:36:54,398 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:36:54" (1/1) ... [2025-01-10 01:36:54,426 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 482 [2025-01-10 01:36:54,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:36:54,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:36:54,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:36:54,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:36:54,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,451 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:36:54,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:36:54,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:36:54,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:36:54,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:36:54,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (1/1) ... [2025-01-10 01:36:54,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:54,502 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:36:54,508 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:36:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:36:54,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:36:54,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:36:54,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:36:54,583 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:36:54,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:36:54,929 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-01-10 01:36:54,929 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:36:54,937 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:36:54,937 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-10 01:36:54,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:54 BoogieIcfgContainer [2025-01-10 01:36:54,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:36:54,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:36:54,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:36:54,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:36:54,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:36:54" (1/3) ... [2025-01-10 01:36:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c04238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:54, skipping insertion in model container [2025-01-10 01:36:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:54" (2/3) ... [2025-01-10 01:36:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c04238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:54, skipping insertion in model container [2025-01-10 01:36:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:54" (3/3) ... [2025-01-10 01:36:54,944 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_math_1.c [2025-01-10 01:36:54,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:36:54,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_math_1.c that has 1 procedures, 166 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-01-10 01:36:55,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:36:55,016 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;@7ede6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:36:55,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-10 01:36:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 165 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:36:55,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:55,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:55,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:36:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -736912375, now seen corresponding path program 1 times [2025-01-10 01:36:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576933767] [2025-01-10 01:36:55,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:55,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:36:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:36:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:55,208 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:36:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576933767] [2025-01-10 01:36:55,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576933767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:55,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:55,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995690824] [2025-01-10 01:36:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:55,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:55,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:55,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:55,230 INFO L87 Difference]: Start difference. First operand has 166 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 165 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:55,293 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2025-01-10 01:36:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:55,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:36:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:55,302 INFO L225 Difference]: With dead ends: 330 [2025-01-10 01:36:55,302 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 01:36:55,336 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:36:55,338 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:55,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 406 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 01:36:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-10 01:36:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.4923076923076923) internal successors, (194), 149 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2025-01-10 01:36:55,375 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 10 [2025-01-10 01:36:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2025-01-10 01:36:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2025-01-10 01:36:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:36:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:55,376 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:36:55,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:36:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 469988416, now seen corresponding path program 1 times [2025-01-10 01:36:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111102154] [2025-01-10 01:36:55,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:55,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:36:55,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:36:55,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:55,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:36:55,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:36:55,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:36:55,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:36:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:36:55,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:36:55,433 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:36:55,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-01-10 01:36:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-01-10 01:36:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-01-10 01:36:55,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:36:55,439 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 01:36:55,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:36:55,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:36:55 BoogieIcfgContainer [2025-01-10 01:36:55,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:36:55,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:36:55,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:36:55,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:36:55,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:54" (3/4) ... [2025-01-10 01:36:55,471 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:36:55,516 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-01-10 01:36:55,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:36:55,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:36:55,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:36:55,554 INFO L158 Benchmark]: Toolchain (without parser) took 1410.23ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 88.4MB in the end (delta: 21.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-01-10 01:36:55,555 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:36:55,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.47ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 95.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:36:55,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.95ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:36:55,558 INFO L158 Benchmark]: Boogie Preprocessor took 47.90ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:36:55,558 INFO L158 Benchmark]: RCFGBuilder took 461.69ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 59.5MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:36:55,558 INFO L158 Benchmark]: TraceAbstraction took 530.20ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 95.4MB in the end (delta: -35.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:36:55,558 INFO L158 Benchmark]: Witness Printer took 83.43ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 88.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:36:55,559 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.19ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.47ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 95.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.95ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.90ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 461.69ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 59.5MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 530.20ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 95.4MB in the end (delta: -35.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.43ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 88.4MB in the end (delta: 7.0MB). 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: 141]: integer overflow possible integer overflow possible We found a FailurePath: [L7] int m_isPowerOfTwo = 1; [L8] int m_IntMath = 2; [L9] int m_log10 = 3; [L10] int m_checkedSubtract = 4; [L11] int m_checkedMultiply = 5; [L12] int m_log2 = 6; [L13] int m_checkedAdd = 7; [L14] int m_mod_1 = 8; [L15] int m_mod_2 = 9; [L16] int m_factorial_1 = 10; [L17] int m_factorial_2 = 11; VAL [m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9] [L22] int q = 0; [L23] int method_id; VAL [m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=0] [L31] int P1=__VERIFIER_nondet_int(); [L32] int P2=__VERIFIER_nondet_int(); [L33] int P3=__VERIFIER_nondet_int(); [L34] int P4=__VERIFIER_nondet_int(); [L35] int P5=__VERIFIER_nondet_int(); [L36] int P6=__VERIFIER_nondet_int(); [L37] int P7=__VERIFIER_nondet_int(); [L38] int P8=__VERIFIER_nondet_int(); [L39] int P9=__VERIFIER_nondet_int(); [L40] int P10=__VERIFIER_nondet_int(); [L41] int P11=__VERIFIER_nondet_int(); [L42] int P12=__VERIFIER_nondet_int(); [L43] int P13=__VERIFIER_nondet_int(); [L44] int P14=__VERIFIER_nondet_int(); [L45] int P15=__VERIFIER_nondet_int(); [L46] int P16=__VERIFIER_nondet_int(); [L47] int P17=__VERIFIER_nondet_int(); [L51] COND TRUE q == 0 [L52] COND TRUE __VERIFIER_nondet_int() [L56] method_id = 2 VAL [P17=0, P1=0, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=0] [L58] COND FALSE !(0) [L62] q = 2 VAL [P17=0, P1=0, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=2] [L31] int P1=__VERIFIER_nondet_int(); [L32] int P2=__VERIFIER_nondet_int(); [L33] int P3=__VERIFIER_nondet_int(); [L34] int P4=__VERIFIER_nondet_int(); [L35] int P5=__VERIFIER_nondet_int(); [L36] int P6=__VERIFIER_nondet_int(); [L37] int P7=__VERIFIER_nondet_int(); [L38] int P8=__VERIFIER_nondet_int(); [L39] int P9=__VERIFIER_nondet_int(); [L40] int P10=__VERIFIER_nondet_int(); [L41] int P11=__VERIFIER_nondet_int(); [L42] int P12=__VERIFIER_nondet_int(); [L43] int P13=__VERIFIER_nondet_int(); [L44] int P14=__VERIFIER_nondet_int(); [L45] int P15=__VERIFIER_nondet_int(); [L46] int P16=__VERIFIER_nondet_int(); [L47] int P17=__VERIFIER_nondet_int(); [L51] COND FALSE !(q == 0) VAL [P17=0, P1=-2147483648, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=2] [L70] COND FALSE !(q == 1) VAL [P17=0, P1=-2147483648, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=2] [L138] COND TRUE q == 2 [L139] COND TRUE __VERIFIER_nondet_int() [L141] 1&& ((((P1 & (P1 - 1)) == 0) && (P1 > 0)) || 0) VAL [P17=0, P1=-2147483648, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=2] [L141] P1 - 1 VAL [P17=0, P2=0, m_IntMath=2, m_checkedAdd=7, m_checkedMultiply=5, m_checkedSubtract=4, m_factorial_1=10, m_factorial_2=11, m_isPowerOfTwo=1, m_log10=3, m_log2=6, m_mod_1=8, m_mod_2=9, q=2] - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 156]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 156]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 156]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 156]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: 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 1 procedures, 166 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 213 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:36:55,574 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)