./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/dijkstra2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/dijkstra2-both-nt.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 3e7687da568dfe273ac225f01dbc8df1f76ef15d8b8e5d222cf6fab4c622d621 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:34:33,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:34:33,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:34:33,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:34:33,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:34:34,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:34:34,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:34:34,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:34:34,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:34:34,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:34:34,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:34:34,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:34:34,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:34:34,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:34:34,017 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:34:34,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:34:34,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:34:34,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:34:34,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:34:34,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:34:34,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:34:34,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:34:34,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:34:34,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:34:34,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:34:34,021 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 -> 3e7687da568dfe273ac225f01dbc8df1f76ef15d8b8e5d222cf6fab4c622d621 [2025-02-06 13:34:34,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:34:34,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:34:34,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:34:34,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:34:34,288 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:34:34,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/dijkstra2-both-nt.c [2025-02-06 13:34:35,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6c021f1/5c15b426ce504c9497ed95dbd6b71f1f/FLAGfbab08078 [2025-02-06 13:34:35,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:34:35,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-nla/dijkstra2-both-nt.c [2025-02-06 13:34:35,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6c021f1/5c15b426ce504c9497ed95dbd6b71f1f/FLAGfbab08078 [2025-02-06 13:34:35,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6c021f1/5c15b426ce504c9497ed95dbd6b71f1f [2025-02-06 13:34:35,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:34:35,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:34:35,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:34:35,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:34:35,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:34:35,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:35,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af9148f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35, skipping insertion in model container [2025-02-06 13:34:35,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:35,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:34:35,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:34:35,946 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:34:35,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:34:35,973 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:34:35,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35 WrapperNode [2025-02-06 13:34:35,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:34:35,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:34:35,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:34:35,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:34:35,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:35,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,002 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-06 13:34:36,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:34:36,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:34:36,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:34:36,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:34:36,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,025 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 13:34:36,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:34:36,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:34:36,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:34:36,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:34:36,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (1/1) ... [2025-02-06 13:34:36,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:34:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:36,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:34:36,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:34:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:34:36,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:34:36,146 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:34:36,148 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:34:36,383 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-06 13:34:36,383 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:34:36,395 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:34:36,396 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:34:36,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:34:36 BoogieIcfgContainer [2025-02-06 13:34:36,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:34:36,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:34:36,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:34:36,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:34:36,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:34:35" (1/3) ... [2025-02-06 13:34:36,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a38772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:34:36, skipping insertion in model container [2025-02-06 13:34:36,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:34:35" (2/3) ... [2025-02-06 13:34:36,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a38772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:34:36, skipping insertion in model container [2025-02-06 13:34:36,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:34:36" (3/3) ... [2025-02-06 13:34:36,405 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra2-both-nt.c [2025-02-06 13:34:36,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:34:36,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra2-both-nt.c that has 1 procedures, 64 locations, 1 initial locations, 1 loop locations, and 26 error locations. [2025-02-06 13:34:36,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:34:36,488 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;@7022a7da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:34:36,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 13:34:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 37 states have (on average 1.864864864864865) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 13:34:36,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:36,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:34:36,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash 93489056, now seen corresponding path program 1 times [2025-02-06 13:34:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057980785] [2025-02-06 13:34:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:36,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:34:36,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:34:36,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:36,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:36,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057980785] [2025-02-06 13:34:36,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057980785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:36,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:34:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912425468] [2025-02-06 13:34:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:34:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:34:36,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:34:36,621 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.864864864864865) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 5.0) 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-06 13:34:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:36,636 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-02-06 13:34:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:34:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) 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-06 13:34:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:36,644 INFO L225 Difference]: With dead ends: 68 [2025-02-06 13:34:36,645 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 13:34:36,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:34:36,653 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:36,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:34:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 13:34:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 13:34:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-02-06 13:34:36,686 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 5 [2025-02-06 13:34:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:36,686 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-02-06 13:34:36,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) 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-06 13:34:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-02-06 13:34:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 13:34:36,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:36,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:34:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:34:36,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1396806531, now seen corresponding path program 1 times [2025-02-06 13:34:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633183805] [2025-02-06 13:34:36,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:34:36,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:34:36,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:36,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193346785] [2025-02-06 13:34:36,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:36,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:36,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:34:36,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:34:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:34:36,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:34:36,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:36,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:36,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:34:36,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:36,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633183805] [2025-02-06 13:34:36,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193346785] [2025-02-06 13:34:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193346785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343582398] [2025-02-06 13:34:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:36,759 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:36,858 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2025-02-06 13:34:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:36,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 13:34:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:36,860 INFO L225 Difference]: With dead ends: 105 [2025-02-06 13:34:36,861 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 13:34:36,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:36,862 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:36,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:34:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 13:34:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2025-02-06 13:34:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 85 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2025-02-06 13:34:36,875 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 6 [2025-02-06 13:34:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:36,876 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2025-02-06 13:34:36,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2025-02-06 13:34:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:34:36,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:36,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:36,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:34:37,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:37,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -351329474, now seen corresponding path program 1 times [2025-02-06 13:34:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:37,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421967940] [2025-02-06 13:34:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:37,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:34:37,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:34:37,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23508585] [2025-02-06 13:34:37,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:37,095 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-06 13:34:37,096 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-06 13:34:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:34:37,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:34:37,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:37,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:34:37,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:37,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421967940] [2025-02-06 13:34:37,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23508585] [2025-02-06 13:34:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23508585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:37,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52123787] [2025-02-06 13:34:37,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:37,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:37,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:37,193 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:37,303 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2025-02-06 13:34:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 13:34:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:37,305 INFO L225 Difference]: With dead ends: 116 [2025-02-06 13:34:37,305 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 13:34:37,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:37,306 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:37,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 65 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:34:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 13:34:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 13:34:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2025-02-06 13:34:37,318 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 7 [2025-02-06 13:34:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:37,318 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2025-02-06 13:34:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2025-02-06 13:34:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:34:37,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:37,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:37,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:34:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1993688219, now seen corresponding path program 1 times [2025-02-06 13:34:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883663784] [2025-02-06 13:34:37,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:37,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:34:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:34:37,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707083033] [2025-02-06 13:34:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:37,532 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-06 13:34:37,533 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-06 13:34:37,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:34:37,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:34:37,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:37,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:34:37,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:37,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883663784] [2025-02-06 13:34:37,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707083033] [2025-02-06 13:34:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707083033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951559722] [2025-02-06 13:34:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:37,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:37,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:37,603 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:37,685 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2025-02-06 13:34:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:34:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:37,687 INFO L225 Difference]: With dead ends: 109 [2025-02-06 13:34:37,687 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 13:34:37,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:37,687 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:37,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:34:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 13:34:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 13:34:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 107 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2025-02-06 13:34:37,700 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 8 [2025-02-06 13:34:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:37,700 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2025-02-06 13:34:37,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2025-02-06 13:34:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:34:37,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:37,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:37,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:34:37,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:37,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 378965177, now seen corresponding path program 1 times [2025-02-06 13:34:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659012315] [2025-02-06 13:34:37,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:37,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:34:37,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:34:37,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758183208] [2025-02-06 13:34:37,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:37,915 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-06 13:34:37,918 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-06 13:34:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:34:37,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:34:37,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:37,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:37,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:34:37,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:37,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659012315] [2025-02-06 13:34:37,999 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758183208] [2025-02-06 13:34:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758183208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:37,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:34:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064366877] [2025-02-06 13:34:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:34:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:38,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:34:38,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:34:38,000 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:38,173 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2025-02-06 13:34:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:34:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:34:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:38,174 INFO L225 Difference]: With dead ends: 121 [2025-02-06 13:34:38,175 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 13:34:38,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:34:38,175 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:38,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 52 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:34:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 13:34:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2025-02-06 13:34:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 107 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2025-02-06 13:34:38,191 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 10 [2025-02-06 13:34:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:38,191 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2025-02-06 13:34:38,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2025-02-06 13:34:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:34:38,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:38,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:38,200 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-06 13:34:38,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:38,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:38,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1136981382, now seen corresponding path program 1 times [2025-02-06 13:34:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216859148] [2025-02-06 13:34:38,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:34:38,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:34:38,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:38,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477552046] [2025-02-06 13:34:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:38,416 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-06 13:34:38,423 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-06 13:34:38,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:34:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:34:38,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:38,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:34:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:38,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216859148] [2025-02-06 13:34:38,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477552046] [2025-02-06 13:34:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477552046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612303067] [2025-02-06 13:34:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:38,518 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:38,586 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2025-02-06 13:34:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:38,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-06 13:34:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:38,588 INFO L225 Difference]: With dead ends: 109 [2025-02-06 13:34:38,588 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 13:34:38,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:38,589 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:38,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 74 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:34:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 13:34:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 13:34:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 107 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-02-06 13:34:38,599 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 11 [2025-02-06 13:34:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:38,599 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-02-06 13:34:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-02-06 13:34:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:34:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:38,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:38,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:34:38,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:38,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -886684457, now seen corresponding path program 1 times [2025-02-06 13:34:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803192112] [2025-02-06 13:34:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:38,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:34:38,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:34:38,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:38,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:34:38,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239917225] [2025-02-06 13:34:38,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:38,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:38,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:38,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:34:38,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:34:38,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:34:38,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:34:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:38,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:34:38,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:38,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:34:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803192112] [2025-02-06 13:34:38,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:34:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239917225] [2025-02-06 13:34:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239917225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874879230] [2025-02-06 13:34:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:38,927 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:38,988 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2025-02-06 13:34:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-02-06 13:34:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:38,989 INFO L225 Difference]: With dead ends: 109 [2025-02-06 13:34:38,989 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 13:34:38,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:38,990 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 75 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-06 13:34:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:34:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 13:34:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 13:34:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.5421686746987953) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2025-02-06 13:34:39,000 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 12 [2025-02-06 13:34:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:39,000 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2025-02-06 13:34:39,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2025-02-06 13:34:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:34:39,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:39,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:39,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:34:39,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 13:34:39,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1778138386, now seen corresponding path program 1 times [2025-02-06 13:34:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040481299] [2025-02-06 13:34:39,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:39,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:34:39,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:34:39,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:39,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040481299] [2025-02-06 13:34:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040481299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:39,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:34:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804180846] [2025-02-06 13:34:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:39,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:39,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:39,291 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:39,305 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2025-02-06 13:34:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:39,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-02-06 13:34:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:39,307 INFO L225 Difference]: With dead ends: 196 [2025-02-06 13:34:39,307 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 13:34:39,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:39,308 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:39,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:34:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 13:34:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 13:34:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2025-02-06 13:34:39,314 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 22 [2025-02-06 13:34:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2025-02-06 13:34:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2025-02-06 13:34:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:34:39,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:39,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:34:39,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -143094359, now seen corresponding path program 1 times [2025-02-06 13:34:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666816361] [2025-02-06 13:34:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:34:39,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:34:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666816361] [2025-02-06 13:34:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666816361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:34:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153219407] [2025-02-06 13:34:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:39,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:34:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:34:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:34:39,699 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:39,998 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2025-02-06 13:34:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:34:39,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2025-02-06 13:34:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:40,000 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:34:40,000 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 13:34:40,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:34:40,001 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:40,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 89 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:34:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 13:34:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2025-02-06 13:34:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2025-02-06 13:34:40,006 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 26 [2025-02-06 13:34:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2025-02-06 13:34:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2025-02-06 13:34:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:34:40,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:40,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:40,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:34:40,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:40,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash -140957846, now seen corresponding path program 1 times [2025-02-06 13:34:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219375274] [2025-02-06 13:34:40,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:34:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:34:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:40,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219375274] [2025-02-06 13:34:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219375274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:34:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379643564] [2025-02-06 13:34:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:40,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:34:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:40,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:34:40,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:34:40,222 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:40,471 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2025-02-06 13:34:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:34:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2025-02-06 13:34:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:40,473 INFO L225 Difference]: With dead ends: 146 [2025-02-06 13:34:40,473 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 13:34:40,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:34:40,474 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:40,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 59 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:34:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 13:34:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-02-06 13:34:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 140 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 175 transitions. [2025-02-06 13:34:40,480 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 175 transitions. Word has length 27 [2025-02-06 13:34:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 175 transitions. [2025-02-06 13:34:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2025-02-06 13:34:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:34:40,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:40,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:34:40,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1367585114, now seen corresponding path program 1 times [2025-02-06 13:34:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422745395] [2025-02-06 13:34:40,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:34:40,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:34:40,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:40,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422745395] [2025-02-06 13:34:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422745395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:34:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627584891] [2025-02-06 13:34:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:40,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:34:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:40,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:34:40,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:34:40,972 INFO L87 Difference]: Start difference. First operand 141 states and 175 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:45,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 13:34:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:46,379 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2025-02-06 13:34:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:34:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 31 [2025-02-06 13:34:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:46,381 INFO L225 Difference]: With dead ends: 160 [2025-02-06 13:34:46,381 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 13:34:46,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:34:46,382 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 111 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:46,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 85 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-06 13:34:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 13:34:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2025-02-06 13:34:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 141 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2025-02-06 13:34:46,387 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 31 [2025-02-06 13:34:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2025-02-06 13:34:46,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2025-02-06 13:34:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 13:34:46,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:46,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:34:46,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 554534403, now seen corresponding path program 1 times [2025-02-06 13:34:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119227083] [2025-02-06 13:34:46,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:46,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:34:46,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:34:46,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:46,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119227083] [2025-02-06 13:34:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119227083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:34:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397818357] [2025-02-06 13:34:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:46,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:34:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:46,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:34:46,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:34:46,652 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:47,214 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2025-02-06 13:34:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:34:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 32 [2025-02-06 13:34:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:47,216 INFO L225 Difference]: With dead ends: 230 [2025-02-06 13:34:47,216 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 13:34:47,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:34:47,217 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 191 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:47,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 84 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:34:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 13:34:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 178. [2025-02-06 13:34:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.5490196078431373) internal successors, (237), 177 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2025-02-06 13:34:47,224 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 32 [2025-02-06 13:34:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:47,226 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2025-02-06 13:34:47,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2025-02-06 13:34:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 13:34:47,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:47,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:47,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:34:47,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:47,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash 10697284, now seen corresponding path program 1 times [2025-02-06 13:34:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210107981] [2025-02-06 13:34:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:47,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:34:47,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:34:47,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:47,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210107981] [2025-02-06 13:34:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210107981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:47,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:34:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824597877] [2025-02-06 13:34:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:34:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:34:47,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:47,286 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:47,333 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2025-02-06 13:34:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:34:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2025-02-06 13:34:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:47,336 INFO L225 Difference]: With dead ends: 178 [2025-02-06 13:34:47,336 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 13:34:47,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:34:47,337 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:47,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 99 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:34:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 13:34:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-06 13:34:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.5359477124183007) internal successors, (235), 176 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 235 transitions. [2025-02-06 13:34:47,345 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 235 transitions. Word has length 33 [2025-02-06 13:34:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 235 transitions. [2025-02-06 13:34:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 235 transitions. [2025-02-06 13:34:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 13:34:47,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:47,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:47,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:34:47,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 331615777, now seen corresponding path program 1 times [2025-02-06 13:34:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286287814] [2025-02-06 13:34:47,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:47,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:34:47,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:34:47,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:47,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286287814] [2025-02-06 13:34:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286287814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:47,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:34:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800023765] [2025-02-06 13:34:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:47,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:34:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:47,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:34:47,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:34:47,638 INFO L87 Difference]: Start difference. First operand 177 states and 235 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:47,978 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2025-02-06 13:34:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:34:47,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 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 34 [2025-02-06 13:34:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:47,979 INFO L225 Difference]: With dead ends: 251 [2025-02-06 13:34:47,979 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 13:34:47,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:34:47,980 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:47,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 89 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:34:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 13:34:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2025-02-06 13:34:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 121 states have (on average 1.462809917355372) internal successors, (177), 144 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2025-02-06 13:34:47,986 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 34 [2025-02-06 13:34:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:47,986 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2025-02-06 13:34:47,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2025-02-06 13:34:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 13:34:47,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:34:47,987 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2025-02-06 13:34:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:34:47,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-06 13:34:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:34:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 334201634, now seen corresponding path program 1 times [2025-02-06 13:34:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:34:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741152682] [2025-02-06 13:34:47,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:34:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:34:47,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:34:47,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:34:47,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:47,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741152682] [2025-02-06 13:34:48,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741152682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:34:48,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:34:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:34:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154392373] [2025-02-06 13:34:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:34:48,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:34:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:48,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:34:48,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:34:48,128 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:34:48,156 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2025-02-06 13:34:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:34:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-02-06 13:34:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:34:48,156 INFO L225 Difference]: With dead ends: 161 [2025-02-06 13:34:48,157 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:34:48,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:34:48,157 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:34:48,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:34:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:34:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:34:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:34:48,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2025-02-06 13:34:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:34:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:34:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:34:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:34:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:34:48,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2025-02-06 13:34:48,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2025-02-06 13:34:48,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2025-02-06 13:34:48,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2025-02-06 13:34:48,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2025-02-06 13:34:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:34:48,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:34:48,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:34:48,225 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:34:48,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:34:48 BoogieIcfgContainer [2025-02-06 13:34:48,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:34:48,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:34:48,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:34:48,242 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:34:48,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:34:36" (3/4) ... [2025-02-06 13:34:48,244 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:34:48,252 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 13:34:48,252 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:34:48,252 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:34:48,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:34:48,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:34:48,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:34:48,317 INFO L158 Benchmark]: Toolchain (without parser) took 12514.49ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 122.3MB in the end (delta: 33.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-02-06 13:34:48,317 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:34:48,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.77ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 145.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:34:48,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.15ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 144.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:34:48,318 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 143.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:34:48,318 INFO L158 Benchmark]: IcfgBuilder took 362.17ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 126.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:34:48,319 INFO L158 Benchmark]: TraceAbstraction took 11842.40ms. Allocated memory is still 201.3MB. Free memory was 126.1MB in the beginning and 128.7MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:34:48,319 INFO L158 Benchmark]: Witness Printer took 75.16ms. Allocated memory is still 201.3MB. Free memory was 128.7MB in the beginning and 122.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:34:48,320 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.24ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.77ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 145.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.15ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 144.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 143.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.17ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 126.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11842.40ms. Allocated memory is still 201.3MB. Free memory was 126.1MB in the beginning and 128.7MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 75.16ms. Allocated memory is still 201.3MB. Free memory was 128.7MB in the beginning and 122.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 524 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1921 IncrementalHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 579 mSDtfsCounter, 1921 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 127 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 3179 SizeOfPredicates, 2 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4/4 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 26 specifications checked. All of them hold - InvariantResult [Line: 41]: Location Invariant Derived location invariant: (((((p == 0) && (q == 1)) && (n <= 0)) && (n == r)) && (0 <= (n + 2147483648))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:34:48,338 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