./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init9_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_init9_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2ffc42929e6643779522a313bb51bbe0e05198e9120e04b929ee1d97b6851bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:34:50,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:34:50,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:34:50,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:34:50,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:34:50,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:34:50,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:34:50,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:34:50,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:34:50,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:34:50,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:34:50,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:34:50,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:34:50,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:34:50,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:34:50,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:34:50,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:34:50,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:34:50,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:34:50,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2ffc42929e6643779522a313bb51bbe0e05198e9120e04b929ee1d97b6851bc [2025-03-09 01:34:50,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:34:50,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:34:50,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:34:50,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:34:50,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:34:50,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init9_ground-1.i [2025-03-09 01:34:51,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718ba41e8/cb175d76a67d4e73ad2d9d0e3989a526/FLAG9490ccd4a [2025-03-09 01:34:51,962 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:34:51,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init9_ground-1.i [2025-03-09 01:34:51,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718ba41e8/cb175d76a67d4e73ad2d9d0e3989a526/FLAG9490ccd4a [2025-03-09 01:34:51,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718ba41e8/cb175d76a67d4e73ad2d9d0e3989a526 [2025-03-09 01:34:51,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:34:51,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:34:51,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:34:51,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:34:51,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:34:51,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:34:51" (1/1) ... [2025-03-09 01:34:51,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a17d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:51, skipping insertion in model container [2025-03-09 01:34:51,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:34:51" (1/1) ... [2025-03-09 01:34:52,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:34:52,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:34:52,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:34:52,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:34:52,148 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:34:52,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52 WrapperNode [2025-03-09 01:34:52,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:34:52,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:34:52,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:34:52,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:34:52,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,171 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-09 01:34:52,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:34:52,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:34:52,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:34:52,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:34:52,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,184 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-03-09 01:34:52,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:34:52,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:34:52,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:34:52,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:34:52,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (1/1) ... [2025-03-09 01:34:52,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:34:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:52,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:34:52,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:34:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:34:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:34:52,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:34:52,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:34:52,469 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-09 01:34:52,477 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-09 01:34:52,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:34:52,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:34:52,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:34:52,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:52 BoogieIcfgContainer [2025-03-09 01:34:52,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:34:52,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:34:52,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:34:52,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:34:52,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:34:51" (1/3) ... [2025-03-09 01:34:52,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2361029f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:34:52, skipping insertion in model container [2025-03-09 01:34:52,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:34:52" (2/3) ... [2025-03-09 01:34:52,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2361029f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:34:52, skipping insertion in model container [2025-03-09 01:34:52,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:52" (3/3) ... [2025-03-09 01:34:52,497 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init9_ground-1.i [2025-03-09 01:34:52,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:34:52,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init9_ground-1.i that has 1 procedures, 60 locations, 1 initial locations, 10 loop locations, and 20 error locations. [2025-03-09 01:34:52,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:34:52,563 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;@e92e30a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:34:52,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-09 01:34:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 59 states have internal predecessors, (71), 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-03-09 01:34:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:34:52,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:52,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:34:52,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:52,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash 3108159, now seen corresponding path program 1 times [2025-03-09 01:34:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227096679] [2025-03-09 01:34:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:52,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:34:52,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:34:52,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227096679] [2025-03-09 01:34:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227096679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:34:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754515336] [2025-03-09 01:34:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:34:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:34:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:52,743 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 59 states have internal predecessors, (71), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 01:34:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:52,908 INFO L93 Difference]: Finished difference Result 141 states and 187 transitions. [2025-03-09 01:34:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:34:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 01:34:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:52,914 INFO L225 Difference]: With dead ends: 141 [2025-03-09 01:34:52,914 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 01:34:52,916 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-03-09 01:34:52,919 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:52,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 01:34:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-09 01:34:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 80 states have internal predecessors, (90), 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-03-09 01:34:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-03-09 01:34:52,950 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 4 [2025-03-09 01:34:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-03-09 01:34:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 01:34:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-03-09 01:34:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:34:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:52,950 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:34:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:34:52,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:52,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1894080862, now seen corresponding path program 1 times [2025-03-09 01:34:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710837324] [2025-03-09 01:34:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:52,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:34:52,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:34:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:52,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710837324] [2025-03-09 01:34:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710837324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318724969] [2025-03-09 01:34:53,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:53,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:53,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:34:53,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:34:53,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:34:53,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:53,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:53,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:34:53,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:34:53,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:34:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318724969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:34:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:34:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497707704] [2025-03-09 01:34:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:53,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:34:53,108 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-03-09 01:34:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:53,225 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-03-09 01:34:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:53,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-09 01:34:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:53,226 INFO L225 Difference]: With dead ends: 81 [2025-03-09 01:34:53,226 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 01:34:53,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:34:53,228 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:53,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 17 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 01:34:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-09 01:34:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 71 states have internal predecessors, (81), 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-03-09 01:34:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-03-09 01:34:53,244 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 7 [2025-03-09 01:34:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:53,244 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-03-09 01:34:53,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-03-09 01:34:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-03-09 01:34:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:34:53,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:53,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 01:34:53,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:34:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:53,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1413035457, now seen corresponding path program 1 times [2025-03-09 01:34:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562920009] [2025-03-09 01:34:53,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:34:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:34:53,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:53,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:34:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562920009] [2025-03-09 01:34:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562920009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:53,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:34:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259067021] [2025-03-09 01:34:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:34:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:53,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:34:53,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:34:53,494 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-09 01:34:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:53,549 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2025-03-09 01:34:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:34:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 01:34:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:53,550 INFO L225 Difference]: With dead ends: 72 [2025-03-09 01:34:53,550 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 01:34:53,550 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-03-09 01:34:53,551 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:53,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 01:34:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2025-03-09 01:34:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 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-03-09 01:34:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-03-09 01:34:53,556 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 8 [2025-03-09 01:34:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:53,556 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-03-09 01:34:53,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-09 01:34:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-03-09 01:34:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 01:34:53,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:53,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:53,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:34:53,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1372546147, now seen corresponding path program 1 times [2025-03-09 01:34:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014322574] [2025-03-09 01:34:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:53,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:34:53,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:34:53,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:53,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:34:53,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014322574] [2025-03-09 01:34:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014322574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239782093] [2025-03-09 01:34:53,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:53,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:53,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:53,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:53,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:34:53,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:34:53,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:34:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:53,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:34:53,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:34:53,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:34:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239782093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:53,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:34:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821523656] [2025-03-09 01:34:53,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:34:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:34:53,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:34:53,795 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-03-09 01:34:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:53,957 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2025-03-09 01:34:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:34:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 42 [2025-03-09 01:34:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:53,958 INFO L225 Difference]: With dead ends: 165 [2025-03-09 01:34:53,958 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 01:34:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:34:53,959 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 42 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:34:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 01:34:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-09 01:34:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.0887096774193548) internal successors, (135), 125 states have internal predecessors, (135), 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-03-09 01:34:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2025-03-09 01:34:53,967 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 42 [2025-03-09 01:34:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2025-03-09 01:34:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-03-09 01:34:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2025-03-09 01:34:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 01:34:53,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:53,969 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:53,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:34:54,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:34:54,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:54,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1832424294, now seen corresponding path program 2 times [2025-03-09 01:34:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158809892] [2025-03-09 01:34:54,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:54,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 01:34:54,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 123 statements. [2025-03-09 01:34:54,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:34:54,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-09 01:34:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158809892] [2025-03-09 01:34:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158809892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:54,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008454825] [2025-03-09 01:34:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:54,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:54,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:54,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:54,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:54,238 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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-03-09 01:34:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:54,258 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2025-03-09 01:34:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 123 [2025-03-09 01:34:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:54,260 INFO L225 Difference]: With dead ends: 133 [2025-03-09 01:34:54,261 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 01:34:54,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:54,262 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:54,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 01:34:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-09 01:34:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 130 states have internal predecessors, (140), 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-03-09 01:34:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-09 01:34:54,272 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 123 [2025-03-09 01:34:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:54,273 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-09 01:34:54,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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-03-09 01:34:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-09 01:34:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-09 01:34:54,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:54,275 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:34:54,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1698420515, now seen corresponding path program 1 times [2025-03-09 01:34:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052245378] [2025-03-09 01:34:54,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:54,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-09 01:34:54,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-09 01:34:54,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:54,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:34:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052245378] [2025-03-09 01:34:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052245378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386278590] [2025-03-09 01:34:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:54,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:54,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:54,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:54,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:34:54,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-09 01:34:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-09 01:34:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:54,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:54,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:34:54,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:34:54,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:34:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386278590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:54,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:54,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 01:34:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015481945] [2025-03-09 01:34:54,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:34:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:54,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:34:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:34:54,766 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-09 01:34:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:55,141 INFO L93 Difference]: Finished difference Result 409 states and 480 transitions. [2025-03-09 01:34:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:34:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 128 [2025-03-09 01:34:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:55,142 INFO L225 Difference]: With dead ends: 409 [2025-03-09 01:34:55,142 INFO L226 Difference]: Without dead ends: 293 [2025-03-09 01:34:55,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:34:55,143 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 436 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:55,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 42 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:34:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-09 01:34:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-09 01:34:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.0378006872852235) internal successors, (302), 292 states have internal predecessors, (302), 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-03-09 01:34:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 302 transitions. [2025-03-09 01:34:55,165 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 302 transitions. Word has length 128 [2025-03-09 01:34:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:55,165 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 302 transitions. [2025-03-09 01:34:55,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-09 01:34:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 302 transitions. [2025-03-09 01:34:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-09 01:34:55,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:55,167 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:55,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:55,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -397664451, now seen corresponding path program 2 times [2025-03-09 01:34:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264210430] [2025-03-09 01:34:55,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:55,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 290 statements into 2 equivalence classes. [2025-03-09 01:34:55,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 290 of 290 statements. [2025-03-09 01:34:55,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:55,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-09 01:34:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264210430] [2025-03-09 01:34:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264210430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:34:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061963166] [2025-03-09 01:34:55,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:34:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:34:55,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:34:55,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:34:55,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 290 statements into 2 equivalence classes. [2025-03-09 01:34:55,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 290 of 290 statements. [2025-03-09 01:34:55,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:34:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:34:55,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:34:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2025-03-09 01:34:56,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:34:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2025-03-09 01:34:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061963166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:34:56,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:34:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 28 [2025-03-09 01:34:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547349924] [2025-03-09 01:34:56,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:34:56,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:34:56,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:56,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:34:56,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:34:56,380 INFO L87 Difference]: Start difference. First operand 293 states and 302 transitions. Second operand has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 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-03-09 01:34:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:57,317 INFO L93 Difference]: Finished difference Result 876 states and 1002 transitions. [2025-03-09 01:34:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 01:34:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 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 290 [2025-03-09 01:34:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:57,321 INFO L225 Difference]: With dead ends: 876 [2025-03-09 01:34:57,321 INFO L226 Difference]: Without dead ends: 616 [2025-03-09 01:34:57,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:34:57,324 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1045 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:57,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 63 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 01:34:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-09 01:34:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2025-03-09 01:34:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 1.016260162601626) internal successors, (625), 615 states have internal predecessors, (625), 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-03-09 01:34:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 625 transitions. [2025-03-09 01:34:57,354 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 625 transitions. Word has length 290 [2025-03-09 01:34:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:57,355 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 625 transitions. [2025-03-09 01:34:57,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 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-03-09 01:34:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 625 transitions. [2025-03-09 01:34:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-03-09 01:34:57,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:34:57,366 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:34:57,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:34:57,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:34:57,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:34:57,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:34:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1377385353, now seen corresponding path program 1 times [2025-03-09 01:34:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:34:57,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642238949] [2025-03-09 01:34:57,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:34:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:34:57,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-09 01:34:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-09 01:34:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:34:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:34:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6436 trivial. 0 not checked. [2025-03-09 01:34:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:34:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642238949] [2025-03-09 01:34:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642238949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:34:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:34:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:34:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323907594] [2025-03-09 01:34:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:34:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:34:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:34:58,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:34:58,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:58,007 INFO L87 Difference]: Start difference. First operand 616 states and 625 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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-03-09 01:34:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:34:58,042 INFO L93 Difference]: Finished difference Result 616 states and 625 transitions. [2025-03-09 01:34:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:34:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 615 [2025-03-09 01:34:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:34:58,045 INFO L225 Difference]: With dead ends: 616 [2025-03-09 01:34:58,045 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:34:58,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:34:58,046 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:34:58,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:34:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:34:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:34:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03-09 01:34:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:34:58,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 615 [2025-03-09 01:34:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:34:58,048 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:34:58,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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-03-09 01:34:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:34:58,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-09 01:34:58,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-09 01:34:58,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-09 01:34:58,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-09 01:34:58,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-09 01:34:58,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-09 01:34:58,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-09 01:34:58,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:34:58,054 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-09 01:34:58,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:34:58,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:34:58,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:34:58 BoogieIcfgContainer [2025-03-09 01:34:58,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:34:58,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:34:58,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:34:58,170 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:34:58,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:34:52" (3/4) ... [2025-03-09 01:34:58,172 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:34:58,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 01:34:58,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:34:58,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:34:58,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:34:58,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:34:58,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:34:58,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:34:58,247 INFO L158 Benchmark]: Toolchain (without parser) took 6258.15ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.3MB in the beginning and 228.4MB in the end (delta: -122.1MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,247 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:34:58,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.31ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.57ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:34:58,248 INFO L158 Benchmark]: Boogie Preprocessor took 18.44ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,248 INFO L158 Benchmark]: IcfgBuilder took 298.19ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,249 INFO L158 Benchmark]: TraceAbstraction took 5677.33ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 77.0MB in the beginning and 233.3MB in the end (delta: -156.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,249 INFO L158 Benchmark]: Witness Printer took 77.07ms. Allocated memory is still 318.8MB. Free memory was 233.3MB in the beginning and 228.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:34:58,251 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.31ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.57ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.44ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 298.19ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5677.33ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 77.0MB in the beginning and 233.3MB in the end (delta: -156.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 77.07ms. Allocated memory is still 318.8MB. Free memory was 233.3MB in the beginning and 228.4MB 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 - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 71 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1648 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1648 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 1076 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1422 IncrementalHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1076 mSolverCounterUnsat, 197 mSDtfsCounter, 1422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=616occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1684 NumberOfCodeBlocks, 1576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2129 ConstructedInterpolants, 0 QuantifiedInterpolants, 2417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1496 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 10840/11205 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 - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 17]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 52]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:34:58,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE