./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_unwindbound100.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 aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:41:26,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:41:26,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:41:26,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:41:26,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:41:26,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:41:26,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:41:26,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:41:26,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:41:26,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:41:26,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:41:26,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:41:26,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:41:26,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:41:26,227 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:41:26,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:41:26,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:41:26,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:41:26,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:41:26,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:41:26,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:41:26,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:41:26,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:41:26,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:41:26,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:41:26,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:41:26,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:41:26,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:41:26,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:41:26,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:41:26,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:41:26,231 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 -> aa72233183b4e91144bd6a6eb8a8b140b7f90e590c3e855f829f337fec510ab9 [2025-02-08 09:41:26,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:41:26,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:41:26,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:41:26,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:41:26,539 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:41:26,539 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_unwindbound100.c [2025-02-08 09:41:27,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485ae2c37/cdc86d84038348eca8c95c60f16e2322/FLAG68d943a60 [2025-02-08 09:41:28,098 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:41:28,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound100.c [2025-02-08 09:41:28,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485ae2c37/cdc86d84038348eca8c95c60f16e2322/FLAG68d943a60 [2025-02-08 09:41:28,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485ae2c37/cdc86d84038348eca8c95c60f16e2322 [2025-02-08 09:41:28,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:41:28,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:41:28,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:41:28,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:41:28,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:41:28,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28, skipping insertion in model container [2025-02-08 09:41:28,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:41:28,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:41:28,600 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:41:28,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:41:28,633 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:41:28,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28 WrapperNode [2025-02-08 09:41:28,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:41:28,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:41:28,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:41:28,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:41:28,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,665 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-08 09:41:28,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:41:28,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:41:28,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:41:28,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:41:28,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,696 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-08 09:41:28,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:41:28,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:41:28,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:41:28,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:41:28,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (1/1) ... [2025-02-08 09:41:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:41:28,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:28,743 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-08 09:41:28,746 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-08 09:41:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:41:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:41:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:41:28,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:41:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:41:28,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:41:28,821 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:41:28,822 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:41:28,971 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-08 09:41:28,972 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:41:28,986 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:41:28,986 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:41:28,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:41:28 BoogieIcfgContainer [2025-02-08 09:41:28,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:41:28,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:41:28,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:41:28,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:41:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:41:28" (1/3) ... [2025-02-08 09:41:28,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f4668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:41:28, skipping insertion in model container [2025-02-08 09:41:28,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:41:28" (2/3) ... [2025-02-08 09:41:28,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f4668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:41:28, skipping insertion in model container [2025-02-08 09:41:28,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:41:28" (3/3) ... [2025-02-08 09:41:28,997 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound100.c [2025-02-08 09:41:29,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:41:29,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound100.c that has 2 procedures, 32 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-08 09:41:29,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:41:29,060 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;@5f2642c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:41:29,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 09:41:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 23 states have internal predecessors, (32), 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-08 09:41:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:41:29,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:29,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:41:29,070 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-08 09:41:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 63875810, now seen corresponding path program 1 times [2025-02-08 09:41:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126574118] [2025-02-08 09:41:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:29,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:41:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:41:29,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:29,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:29,186 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-08 09:41:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126574118] [2025-02-08 09:41:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126574118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:41:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951082912] [2025-02-08 09:41:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 09:41:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:29,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 09:41:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:41:29,209 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 23 states have internal predecessors, (32), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 09:41:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:29,222 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2025-02-08 09:41:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 09:41:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-02-08 09:41:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:29,227 INFO L225 Difference]: With dead ends: 62 [2025-02-08 09:41:29,227 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 09:41:29,230 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-08 09:41:29,232 INFO L435 NwaCegarLoop]: 42 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, 42 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-08 09:41:29,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 09:41:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 09:41:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 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-08 09:41:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-08 09:41:29,259 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 5 [2025-02-08 09:41:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:29,259 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-08 09:41:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 09:41:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-08 09:41:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:41:29,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:29,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:41:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:41:29,260 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-08 09:41:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 63905601, now seen corresponding path program 1 times [2025-02-08 09:41:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253203549] [2025-02-08 09:41:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:41:29,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:41:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:29,349 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-08 09:41:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253203549] [2025-02-08 09:41:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253203549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:29,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:29,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:41:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995998168] [2025-02-08 09:41:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:29,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:41:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:29,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:41:29,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:41:29,351 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 09:41:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:29,414 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-02-08 09:41:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:41:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-08 09:41:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:29,415 INFO L225 Difference]: With dead ends: 36 [2025-02-08 09:41:29,416 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 09:41:29,416 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-08 09:41:29,419 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 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-08 09:41:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 09:41:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-02-08 09:41:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-08 09:41:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-08 09:41:29,430 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 5 [2025-02-08 09:41:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 09:41:29,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 09:41:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-08 09:41:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:41:29,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:29,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:41:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:41:29,430 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-08 09:41:29,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1981073629, now seen corresponding path program 1 times [2025-02-08 09:41:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-02-08 09:41:29,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:29,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:41:29,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:41:29,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:29,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:29,478 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-08 09:41:29,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-02-08 09:41:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904167872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:29,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:29,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:41:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650785663] [2025-02-08 09:41:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:41:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:29,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:41:29,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:41:29,481 INFO L87 Difference]: Start difference. First operand 30 states and 36 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-08 09:41:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:29,530 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-08 09:41:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:41:29,532 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-08 09:41:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:29,533 INFO L225 Difference]: With dead ends: 49 [2025-02-08 09:41:29,533 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 09:41:29,533 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-08 09:41:29,534 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 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-08 09:41:29,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 09:41:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 09:41:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 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-08 09:41:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-02-08 09:41:29,543 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 6 [2025-02-08 09:41:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:29,543 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-08 09:41:29,543 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-08 09:41:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-02-08 09:41:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 09:41:29,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:29,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:29,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:41:29,545 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-08 09:41:29,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 592676113, now seen corresponding path program 1 times [2025-02-08 09:41:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154133110] [2025-02-08 09:41:29,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 09:41:29,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 09:41:29,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:29,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:29,737 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-08 09:41:29,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:29,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154133110] [2025-02-08 09:41:29,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154133110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:29,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:41:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709073188] [2025-02-08 09:41:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:41:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:29,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:41:29,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:41:29,739 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:41:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:29,820 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-02-08 09:41:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:41:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 25 [2025-02-08 09:41:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:29,823 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:41:29,823 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 09:41:29,824 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-08 09:41:29,824 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:29,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 09:41:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 09:41:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-08 09:41:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-08 09:41:29,835 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2025-02-08 09:41:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-08 09:41:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:41:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-08 09:41:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 09:41:29,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:29,836 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-08 09:41:29,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:41:29,836 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-08 09:41:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1193090302, now seen corresponding path program 1 times [2025-02-08 09:41:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163315213] [2025-02-08 09:41:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 09:41:29,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 09:41:29,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:29,968 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-08 09:41:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163315213] [2025-02-08 09:41:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163315213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:41:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453954236] [2025-02-08 09:41:29,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:29,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:41:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:41:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:41:29,970 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-08 09:41:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:30,066 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-08 09:41:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:41:30,067 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-08 09:41:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:30,068 INFO L225 Difference]: With dead ends: 50 [2025-02-08 09:41:30,068 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 09:41:30,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:41:30,068 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:30,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 107 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:41:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 09:41:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-08 09:41:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:41:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-08 09:41:30,084 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2025-02-08 09:41:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:30,084 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-08 09:41:30,084 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-08 09:41:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-08 09:41:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 09:41:30,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:30,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:30,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:41:30,085 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-08 09:41:30,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1193164779, now seen corresponding path program 1 times [2025-02-08 09:41:30,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607636428] [2025-02-08 09:41:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:30,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 09:41:30,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 09:41:30,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:41:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607636428] [2025-02-08 09:41:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607636428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:41:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986065896] [2025-02-08 09:41:30,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:30,214 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-08 09:41:30,216 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-08 09:41:30,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 09:41:30,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 09:41:30,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:30,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:30,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:41:30,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:41:30,362 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-08 09:41:30,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:41:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986065896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:30,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:41:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 09:41:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097345353] [2025-02-08 09:41:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:30,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:41:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:30,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:41:30,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:41:30,365 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 09:41:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:30,433 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-02-08 09:41:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:41:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 09:41:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:30,435 INFO L225 Difference]: With dead ends: 48 [2025-02-08 09:41:30,435 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 09:41:30,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:41:30,437 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:30,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 09:41:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2025-02-08 09:41:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:41:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2025-02-08 09:41:30,449 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 26 [2025-02-08 09:41:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:30,450 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2025-02-08 09:41:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 09:41:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2025-02-08 09:41:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 09:41:30,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:30,451 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] [2025-02-08 09:41:30,460 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-08 09:41:30,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:30,652 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-08 09:41:30,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 215270047, now seen corresponding path program 1 times [2025-02-08 09:41:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352302598] [2025-02-08 09:41:30,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:30,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 09:41:30,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 09:41:30,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:30,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:41:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352302598] [2025-02-08 09:41:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352302598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:41:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482915171] [2025-02-08 09:41:30,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:30,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:30,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:41:30,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:41:30,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 09:41:30,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 09:41:30,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:30,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:30,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:41:30,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:41:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:41:30,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:41:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:41:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482915171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:41:30,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:41:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-08 09:41:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198486876] [2025-02-08 09:41:30,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:41:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:41:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:30,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:41:30,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:41:30,929 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-08 09:41:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:31,112 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2025-02-08 09:41:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 09:41:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 30 [2025-02-08 09:41:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:31,114 INFO L225 Difference]: With dead ends: 92 [2025-02-08 09:41:31,114 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 09:41:31,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-02-08 09:41:31,117 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:31,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 159 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:41:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 09:41:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2025-02-08 09:41:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 09:41:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-02-08 09:41:31,133 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 30 [2025-02-08 09:41:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:31,133 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-02-08 09:41:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-08 09:41:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-02-08 09:41:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 09:41:31,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:31,136 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:31,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:41:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:31,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:41:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 974715883, now seen corresponding path program 1 times [2025-02-08 09:41:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-02-08 09:41:31,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 09:41:31,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 09:41:31,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:41:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-02-08 09:41:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618203417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:41:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077311592] [2025-02-08 09:41:31,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:31,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:41:31,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:41:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 09:41:31,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 09:41:31,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:31,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:31,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:41:31,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:41:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 09:41:31,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:41:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:41:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077311592] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:41:31,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:41:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-08 09:41:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103050139] [2025-02-08 09:41:31,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:41:31,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 09:41:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:31,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 09:41:31,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:41:31,798 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-08 09:41:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:32,168 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2025-02-08 09:41:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 09:41:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 42 [2025-02-08 09:41:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:32,170 INFO L225 Difference]: With dead ends: 132 [2025-02-08 09:41:32,170 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 09:41:32,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 09:41:32,172 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:32,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 129 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:41:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 09:41:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 09:41:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.125) internal successors, (108), 96 states have internal predecessors, (108), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 09:41:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2025-02-08 09:41:32,200 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 42 [2025-02-08 09:41:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:32,201 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2025-02-08 09:41:32,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-08 09:41:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2025-02-08 09:41:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 09:41:32,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:32,202 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:32,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 09:41:32,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:32,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:41:32,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -497741623, now seen corresponding path program 2 times [2025-02-08 09:41:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-02-08 09:41:32,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:41:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:32,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-08 09:41:32,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:41:32,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:41:32,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-08 09:41:32,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:32,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-02-08 09:41:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393328281] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:41:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459864890] [2025-02-08 09:41:32,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:41:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:32,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:41:32,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:41:32,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-08 09:41:32,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:41:32,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:41:32,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:32,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:41:32,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:41:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 09:41:33,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:41:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-08 09:41:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459864890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:41:33,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:41:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2025-02-08 09:41:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226228556] [2025-02-08 09:41:33,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:41:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-08 09:41:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-08 09:41:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2025-02-08 09:41:33,467 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-08 09:41:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:34,070 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2025-02-08 09:41:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 09:41:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 90 [2025-02-08 09:41:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:34,075 INFO L225 Difference]: With dead ends: 233 [2025-02-08 09:41:34,075 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 09:41:34,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=906, Invalid=2516, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 09:41:34,079 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 204 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 236 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:41:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 09:41:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 143. [2025-02-08 09:41:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.125) internal successors, (117), 104 states have internal predecessors, (117), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 09:41:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2025-02-08 09:41:34,108 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 90 [2025-02-08 09:41:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:34,108 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2025-02-08 09:41:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-08 09:41:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2025-02-08 09:41:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 09:41:34,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:34,110 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:34,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 09:41:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 09:41:34,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:41:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1495158592, now seen corresponding path program 1 times [2025-02-08 09:41:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124483580] [2025-02-08 09:41:34,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:34,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 09:41:34,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 09:41:34,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:34,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-08 09:41:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124483580] [2025-02-08 09:41:34,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124483580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:41:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272765979] [2025-02-08 09:41:34,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:41:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:41:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:41:34,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:41:34,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:41:34,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 09:41:34,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 09:41:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:41:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 09:41:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:41:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:41:35,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:41:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-08 09:41:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272765979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:41:35,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:41:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-02-08 09:41:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549598709] [2025-02-08 09:41:35,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:41:35,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 09:41:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:35,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 09:41:35,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 09:41:35,670 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand has 42 states, 41 states have (on average 3.317073170731707) internal successors, (136), 42 states have internal predecessors, (136), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2025-02-08 09:41:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:36,959 INFO L93 Difference]: Finished difference Result 369 states and 443 transitions. [2025-02-08 09:41:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-08 09:41:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.317073170731707) internal successors, (136), 42 states have internal predecessors, (136), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 110 [2025-02-08 09:41:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:36,962 INFO L225 Difference]: With dead ends: 369 [2025-02-08 09:41:36,963 INFO L226 Difference]: Without dead ends: 368 [2025-02-08 09:41:36,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2025-02-08 09:41:36,966 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 292 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:36,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 287 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:41:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-08 09:41:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 251. [2025-02-08 09:41:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 185 states have (on average 1.1189189189189188) internal successors, (207), 185 states have internal predecessors, (207), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-08 09:41:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2025-02-08 09:41:37,002 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 110 [2025-02-08 09:41:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:37,003 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2025-02-08 09:41:37,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.317073170731707) internal successors, (136), 42 states have internal predecessors, (136), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2025-02-08 09:41:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2025-02-08 09:41:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-08 09:41:37,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:41:37,010 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 09:41:37,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 09:41:37,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 09:41:37,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:41:37,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:41:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1679713628, now seen corresponding path program 2 times [2025-02-08 09:41:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:41:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-02-08 09:41:37,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:41:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:41:37,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-02-08 09:41:37,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 226 of 226 statements. [2025-02-08 09:41:37,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:41:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:41:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2025-02-08 09:41:37,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:41:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-02-08 09:41:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820111603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:41:37,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:41:37,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:41:37,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204443305] [2025-02-08 09:41:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:41:37,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:41:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:41:37,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:41:37,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:41:37,430 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:41:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:41:37,492 INFO L93 Difference]: Finished difference Result 255 states and 301 transitions. [2025-02-08 09:41:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:41:37,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 226 [2025-02-08 09:41:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:41:37,494 INFO L225 Difference]: With dead ends: 255 [2025-02-08 09:41:37,494 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:41:37,495 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-08 09:41:37,495 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:41:37,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:41:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:41:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:41:37,496 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-08 09:41:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:41:37,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2025-02-08 09:41:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:41:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:41:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:41:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:41:37,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:41:37,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 09:41:37,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 09:41:37,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 09:41:37,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 09:41:37,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 09:41:37,505 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:41:37,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:41:37,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:41:37,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:41:37 BoogieIcfgContainer [2025-02-08 09:41:37,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:41:37,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:41:37,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:41:37,945 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:41:37,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:41:28" (3/4) ... [2025-02-08 09:41:37,947 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:41:37,952 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 09:41:37,956 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 09:41:37,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:41:37,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:41:37,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:41:38,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:41:38,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:41:38,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:41:38,030 INFO L158 Benchmark]: Toolchain (without parser) took 9600.25ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 114.2MB in the beginning and 163.4MB in the end (delta: -49.2MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. [2025-02-08 09:41:38,030 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:41:38,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.68ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 103.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:41:38,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.60ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 995.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:41:38,031 INFO L158 Benchmark]: Boogie Preprocessor took 39.83ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:41:38,031 INFO L158 Benchmark]: IcfgBuilder took 278.55ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 87.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:41:38,032 INFO L158 Benchmark]: TraceAbstraction took 8954.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.2MB in the beginning and 171.6MB in the end (delta: -84.4MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. [2025-02-08 09:41:38,032 INFO L158 Benchmark]: Witness Printer took 84.69ms. Allocated memory is still 427.8MB. Free memory was 171.6MB in the beginning and 163.4MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:41:38,033 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.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.68ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 103.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.60ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 102.0MB in the end (delta: 995.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.83ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.55ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 87.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8954.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.2MB in the beginning and 171.6MB in the end (delta: -84.4MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. * Witness Printer took 84.69ms. Allocated memory is still 427.8MB. Free memory was 171.6MB in the beginning and 163.4MB in the end (delta: 8.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, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 734 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 1342 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1052 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 897 IncrementalHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 290 mSDtfsCounter, 897 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=10, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 216 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 2305 SizeOfPredicates, 27 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 3595/4549 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: ((counter <= 101) && (1 <= counter)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 100)) || (counter == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:41:38,053 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