./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 028e685e2884f4921a1d3a5f17273c125157e1c3b8bccd76f295d2a14fe44019 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:12:47,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:12:47,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:12:47,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:12:47,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:12:47,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:12:47,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:12:47,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:12:47,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:12:47,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:12:47,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:12:47,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:12:47,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:12:47,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:12:47,957 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:12:47,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:12:47,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:12:47,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:12:47,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:12:47,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:12:47,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:12:47,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:12:47,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:12:47,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:12:47,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:12:47,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 028e685e2884f4921a1d3a5f17273c125157e1c3b8bccd76f295d2a14fe44019 [2025-02-06 14:12:48,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:12:48,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:12:48,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:12:48,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:12:48,199 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:12:48,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound1.c [2025-02-06 14:12:49,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9702eeed5/7f817b4e932b49198dc9846e76ab9a60/FLAGddeed122c [2025-02-06 14:12:49,554 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:12:49,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound1.c [2025-02-06 14:12:49,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9702eeed5/7f817b4e932b49198dc9846e76ab9a60/FLAGddeed122c [2025-02-06 14:12:49,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9702eeed5/7f817b4e932b49198dc9846e76ab9a60 [2025-02-06 14:12:49,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:12:49,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:12:49,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:12:49,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:12:49,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:12:49,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:49" (1/1) ... [2025-02-06 14:12:49,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:49, skipping insertion in model container [2025-02-06 14:12:49,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:49" (1/1) ... [2025-02-06 14:12:49,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:12:50,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:12:50,065 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:12:50,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:12:50,090 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:12:50,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50 WrapperNode [2025-02-06 14:12:50,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:12:50,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:12:50,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:12:50,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:12:50,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,112 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-06 14:12:50,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:12:50,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:12:50,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:12:50,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:12:50,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,128 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:12:50,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:12:50,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:12:50,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:12:50,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:12:50,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (1/1) ... [2025-02-06 14:12:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:12:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:12:50,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:12:50,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:12:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:12:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:12:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:12:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:12:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:12:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:12:50,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:12:50,234 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:12:50,353 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 14:12:50,353 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:12:50,362 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:12:50,362 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:12:50,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:50 BoogieIcfgContainer [2025-02-06 14:12:50,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:12:50,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:12:50,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:12:50,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:12:50,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:12:49" (1/3) ... [2025-02-06 14:12:50,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1963283a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:50, skipping insertion in model container [2025-02-06 14:12:50,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:50" (2/3) ... [2025-02-06 14:12:50,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1963283a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:50, skipping insertion in model container [2025-02-06 14:12:50,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:50" (3/3) ... [2025-02-06 14:12:50,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound1.c [2025-02-06 14:12:50,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:12:50,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound1.c that has 2 procedures, 36 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 14:12:50,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:12:50,419 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;@30896f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:12:50,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 14:12:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:12:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:12:50,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:50,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:12:50,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2069824990, now seen corresponding path program 1 times [2025-02-06 14:12:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910889828] [2025-02-06 14:12:50,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:50,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:12:50,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:12:50,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:50,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:12:50,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910889828] [2025-02-06 14:12:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910889828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:12:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812595141] [2025-02-06 14:12:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:50,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:12:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:12:50,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:12:50,571 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-06 14:12:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:50,591 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2025-02-06 14:12:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:12:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-06 14:12:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:50,597 INFO L225 Difference]: With dead ends: 68 [2025-02-06 14:12:50,597 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 14:12:50,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:12:50,604 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:50,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 14:12:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 14:12:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:12:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-06 14:12:50,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2025-02-06 14:12:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:50,638 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-06 14:12:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-06 14:12:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-06 14:12:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:12:50,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:50,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:12:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:12:50,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2069854781, now seen corresponding path program 1 times [2025-02-06 14:12:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-02-06 14:12:50,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:12:50,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:12:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:12:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-02-06 14:12:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784879975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:12:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267771253] [2025-02-06 14:12:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:12:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:50,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:12:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:12:50,734 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 14:12:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:50,775 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-02-06 14:12:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:12:50,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-06 14:12:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:50,776 INFO L225 Difference]: With dead ends: 37 [2025-02-06 14:12:50,776 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 14:12:50,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-06 14:12:50,777 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:50,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 14:12:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-02-06 14:12:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:12:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-06 14:12:50,783 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2025-02-06 14:12:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-06 14:12:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 14:12:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-06 14:12:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:12:50,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:50,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:12:50,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -259011229, now seen corresponding path program 1 times [2025-02-06 14:12:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975548607] [2025-02-06 14:12:50,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:50,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:12:50,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:12:50,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:50,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:12:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975548607] [2025-02-06 14:12:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975548607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:12:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689736510] [2025-02-06 14:12:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:12:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:50,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:12:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:12:50,851 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-06 14:12:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:50,883 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-06 14:12:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:12:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-06 14:12:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:50,884 INFO L225 Difference]: With dead ends: 50 [2025-02-06 14:12:50,886 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 14:12:50,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-06 14:12:50,886 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 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-02-06 14:12:50,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 14:12:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 14:12:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:12:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-06 14:12:50,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-02-06 14:12:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:50,893 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 14:12:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-06 14:12:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-06 14:12:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:12:50,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:50,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:12:50,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1106859082, now seen corresponding path program 1 times [2025-02-06 14:12:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-02-06 14:12:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:50,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:12:50,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:12:50,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-02-06 14:12:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307163132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:12:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329842998] [2025-02-06 14:12:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:12:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:12:51,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:12:51,068 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:51,138 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-06 14:12:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:12:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-02-06 14:12:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:51,139 INFO L225 Difference]: With dead ends: 40 [2025-02-06 14:12:51,139 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 14:12:51,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:12:51,140 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:51,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 14:12:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-06 14:12:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:12:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-06 14:12:51,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 26 [2025-02-06 14:12:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:51,147 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-06 14:12:51,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-02-06 14:12:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:12:51,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:51,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:51,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:12:51,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:51,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash -47106841, now seen corresponding path program 1 times [2025-02-06 14:12:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-02-06 14:12:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:51,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:12:51,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:12:51,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:51,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-02-06 14:12:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587284337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:12:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883864424] [2025-02-06 14:12:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:12:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:12:51,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:12:51,243 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:51,308 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-02-06 14:12:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:12:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-06 14:12:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:51,309 INFO L225 Difference]: With dead ends: 29 [2025-02-06 14:12:51,309 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 14:12:51,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:12:51,310 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:51,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 14:12:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-06 14:12:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:12:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-06 14:12:51,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2025-02-06 14:12:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-06 14:12:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-06 14:12:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:12:51,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:51,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:51,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:12:51,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:51,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -47032364, now seen corresponding path program 1 times [2025-02-06 14:12:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526346865] [2025-02-06 14:12:51,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:12:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:12:51,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:51,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526346865] [2025-02-06 14:12:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526346865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:12:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:12:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:12:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352825728] [2025-02-06 14:12:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:12:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:12:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:51,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:12:51,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:12:51,369 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:51,402 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-02-06 14:12:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:12:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-06 14:12:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:51,402 INFO L225 Difference]: With dead ends: 25 [2025-02-06 14:12:51,402 INFO L226 Difference]: Without dead ends: 24 [2025-02-06 14:12:51,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:12:51,403 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:51,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 43 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-06 14:12:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-06 14:12:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:12:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-02-06 14:12:51,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 27 [2025-02-06 14:12:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-02-06 14:12:51,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:12:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-02-06 14:12:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:12:51,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:12:51,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:12:51,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:12:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:12:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash -371609976, now seen corresponding path program 1 times [2025-02-06 14:12:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:12:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878221737] [2025-02-06 14:12:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:12:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:12:51,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:12:51,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:12:51,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878221737] [2025-02-06 14:12:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878221737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:12:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030648442] [2025-02-06 14:12:51,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:12:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:12:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:12:51,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:12:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:12:51,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:12:51,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:12:51,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:12:51,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:12:51,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:12:51,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:12:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:12:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:12:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030648442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:12:51,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:12:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 14:12:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476166125] [2025-02-06 14:12:51,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:12:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:12:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:12:51,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:12:51,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:12:51,739 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 14:12:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:12:51,790 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-02-06 14:12:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:12:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2025-02-06 14:12:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:12:51,791 INFO L225 Difference]: With dead ends: 24 [2025-02-06 14:12:51,791 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:12:51,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:12:51,792 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:12:51,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:12:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:12:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:12:51,792 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-02-06 14:12:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:12:51,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-02-06 14:12:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:12:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:12:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 14:12:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:12:51,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:12:51,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 14:12:51,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 14:12:51,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 14:12:51,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 14:12:51,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:12:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:12:52,002 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:12:52,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:12:52,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:12:52,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:12:52 BoogieIcfgContainer [2025-02-06 14:12:52,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:12:52,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:12:52,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:12:52,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:12:52,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:50" (3/4) ... [2025-02-06 14:12:52,042 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:12:52,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:12:52,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 14:12:52,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:12:52,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:12:52,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:12:52,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:12:52,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:12:52,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:12:52,097 INFO L158 Benchmark]: Toolchain (without parser) took 2163.55ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 40.0MB in the end (delta: 66.0MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-02-06 14:12:52,097 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:12:52,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.28ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 94.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:12:52,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.69ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:12:52,097 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 476.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:12:52,098 INFO L158 Benchmark]: IcfgBuilder took 225.92ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 80.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:12:52,098 INFO L158 Benchmark]: TraceAbstraction took 1676.03ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 46.2MB in the end (delta: 33.0MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2025-02-06 14:12:52,098 INFO L158 Benchmark]: Witness Printer took 55.87ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 40.0MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:12:52,099 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.28ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 94.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.69ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 476.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 225.92ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 80.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1676.03ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 46.2MB in the end (delta: 33.0MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 55.87ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 40.0MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 164 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 371 SizeOfPredicates, 3 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 84/87 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 4 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((1 <= counter) && (counter <= 2)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((counter == 0) || (counter == 1)) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:12:52,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE