./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i -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 e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:56:26,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:56:26,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:56:26,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:56:26,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:56:26,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:56:26,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:56:26,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:56:26,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:56:26,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:56:26,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:56:26,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:56:26,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:56:26,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:26,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:26,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:26,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:56:26,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:56:26,094 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 -> e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 [2025-01-10 01:56:26,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:56:26,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:56:26,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:56:26,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:56:26,377 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:56:26,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2025-01-10 01:56:27,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614946b88/b0d2ff526af4489dab792fd01e4884f3/FLAG39c057a1b [2025-01-10 01:56:27,970 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:56:27,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2025-01-10 01:56:27,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614946b88/b0d2ff526af4489dab792fd01e4884f3/FLAG39c057a1b [2025-01-10 01:56:28,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614946b88/b0d2ff526af4489dab792fd01e4884f3 [2025-01-10 01:56:28,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:56:28,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:56:28,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:28,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:56:28,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:56:28,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2017b91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28, skipping insertion in model container [2025-01-10 01:56:28,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:56:28,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:28,173 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:56:28,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:28,198 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:56:28,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28 WrapperNode [2025-01-10 01:56:28,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:28,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:28,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:56:28,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:56:28,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,225 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-01-10 01:56:28,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:28,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:56:28,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:56:28,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:56:28,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:56:28,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:56:28,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:56:28,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:56:28,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:56:28,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (1/1) ... [2025-01-10 01:56:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:28,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:56:28,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:56:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:56:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:56:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:56:28,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:56:28,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:56:28,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:56:28,364 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:56:28,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:56:28,463 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-10 01:56:28,463 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:56:28,469 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:56:28,469 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:56:28,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:28 BoogieIcfgContainer [2025-01-10 01:56:28,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:56:28,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:56:28,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:56:28,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:56:28,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:56:28" (1/3) ... [2025-01-10 01:56:28,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7cfcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:28, skipping insertion in model container [2025-01-10 01:56:28,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:28" (2/3) ... [2025-01-10 01:56:28,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7cfcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:28, skipping insertion in model container [2025-01-10 01:56:28,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:28" (3/3) ... [2025-01-10 01:56:28,476 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2025-01-10 01:56:28,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:56:28,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_unwindbound5.i that has 2 procedures, 30 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:56:28,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:56:28,525 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;@3225f5aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:56:28,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:56:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:56:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:56:28,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:28,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:56:28,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:28,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:56:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644697977] [2025-01-10 01:56:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:28,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:56:28,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:56:28,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:28,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644697977] [2025-01-10 01:56:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644697977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:28,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:56:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299160312] [2025-01-10 01:56:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:28,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:28,687 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:28,749 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2025-01-10 01:56:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:56:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:56:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:28,756 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:56:28,756 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:56:28,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:28,763 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:28,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:56:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-01-10 01:56:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-10 01:56:28,790 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2025-01-10 01:56:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:28,790 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 01:56:28,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-01-10 01:56:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:56:28,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:28,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:56:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:56:28,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:28,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 01:56:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877149002] [2025-01-10 01:56:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:56:28,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:56:28,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877149002] [2025-01-10 01:56:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877149002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:56:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777398381] [2025-01-10 01:56:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:28,831 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:28,869 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-10 01:56:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:56:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:28,871 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:56:28,871 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:56:28,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:28,873 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:28,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:56:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 01:56:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-10 01:56:28,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2025-01-10 01:56:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:28,881 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-10 01:56:28,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-10 01:56:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:56:28,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:28,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:28,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:56:28,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash 262869484, now seen corresponding path program 1 times [2025-01-10 01:56:28,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825586940] [2025-01-10 01:56:28,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:28,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:56:28,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:56:28,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:28,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825586940] [2025-01-10 01:56:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825586940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:28,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:56:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454189330] [2025-01-10 01:56:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:28,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:28,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:28,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:28,998 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:29,067 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-01-10 01:56:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:56:29,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-01-10 01:56:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:29,068 INFO L225 Difference]: With dead ends: 25 [2025-01-10 01:56:29,068 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:56:29,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:29,069 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:29,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:56:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:56:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-01-10 01:56:29,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-01-10 01:56:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:29,074 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-01-10 01:56:29,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-01-10 01:56:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:56:29,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:29,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:56:29,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -440980527, now seen corresponding path program 1 times [2025-01-10 01:56:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97239175] [2025-01-10 01:56:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:29,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:56:29,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:56:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97239175] [2025-01-10 01:56:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97239175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:29,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:56:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035315393] [2025-01-10 01:56:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:29,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:29,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:29,165 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:29,229 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-01-10 01:56:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:56:29,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:56:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:29,231 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:56:29,231 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:56:29,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:29,232 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:29,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:56:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-01-10 01:56:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-10 01:56:29,237 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2025-01-10 01:56:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-10 01:56:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-10 01:56:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:56:29,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:29,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:29,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:56:29,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash -440941798, now seen corresponding path program 1 times [2025-01-10 01:56:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472166342] [2025-01-10 01:56:29,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:29,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:56:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:56:29,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472166342] [2025-01-10 01:56:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472166342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997759272] [2025-01-10 01:56:29,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:29,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:29,322 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-01-10 01:56:29,324 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-01-10 01:56:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:56:29,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:56:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:29,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:56:29,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:56:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997759272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:29,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:56:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-01-10 01:56:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379710833] [2025-01-10 01:56:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:29,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:29,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:29,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:29,416 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:29,452 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-01-10 01:56:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:56:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:29,453 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:56:29,453 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:56:29,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:56:29,454 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:29,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:56:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-10 01:56:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-01-10 01:56:29,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2025-01-10 01:56:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:29,457 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-10 01:56:29,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-01-10 01:56:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:56:29,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:29,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:29,464 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-01-10 01:56:29,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:29,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -274597848, now seen corresponding path program 1 times [2025-01-10 01:56:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901566609] [2025-01-10 01:56:29,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:29,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:56:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:56:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901566609] [2025-01-10 01:56:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901566609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858666826] [2025-01-10 01:56:29,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:29,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:29,715 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-01-10 01:56:29,717 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-01-10 01:56:29,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:56:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:56:29,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:29,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:29,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:56:29,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858666826] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:29,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:29,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 01:56:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718208566] [2025-01-10 01:56:29,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:56:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:29,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:56:29,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:56:29,828 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:29,922 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-01-10 01:56:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:56:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 14 [2025-01-10 01:56:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:29,923 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:56:29,923 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:56:29,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:56:29,924 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:29,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:56:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-01-10 01:56:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-10 01:56:29,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2025-01-10 01:56:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:29,928 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-10 01:56:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-10 01:56:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:56:29,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:29,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:29,935 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-01-10 01:56:30,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:30,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash 75314011, now seen corresponding path program 1 times [2025-01-10 01:56:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002475417] [2025-01-10 01:56:30,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:30,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:30,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:30,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:30,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002475417] [2025-01-10 01:56:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002475417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626270767] [2025-01-10 01:56:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:30,239 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-01-10 01:56:30,248 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-01-10 01:56:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:30,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:56:30,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:30,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:30,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626270767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:30,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:30,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 01:56:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403509906] [2025-01-10 01:56:30,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:30,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:56:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:30,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:56:30,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:56:30,433 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:30,678 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-01-10 01:56:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:56:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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 15 [2025-01-10 01:56:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:30,683 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:56:30,683 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 01:56:30,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:56:30,688 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:30,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 01:56:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-10 01:56:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-01-10 01:56:30,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2025-01-10 01:56:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-01-10 01:56:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:56:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-01-10 01:56:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 01:56:30,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:30,703 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:30,711 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-01-10 01:56:30,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:30,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:30,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -258248724, now seen corresponding path program 1 times [2025-01-10 01:56:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443480895] [2025-01-10 01:56:30,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:30,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:56:30,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:56:30,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:30,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:56:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443480895] [2025-01-10 01:56:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443480895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404866948] [2025-01-10 01:56:31,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:31,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:31,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:31,117 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-01-10 01:56:31,118 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-01-10 01:56:31,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:56:31,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:56:31,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:31,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:31,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:56:31,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:56:31,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:56:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404866948] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:31,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 01:56:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173744986] [2025-01-10 01:56:31,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:56:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:31,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:56:31,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:56:31,529 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:56:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:32,081 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2025-01-10 01:56:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:56:32,082 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 43 [2025-01-10 01:56:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:32,083 INFO L225 Difference]: With dead ends: 216 [2025-01-10 01:56:32,083 INFO L226 Difference]: Without dead ends: 215 [2025-01-10 01:56:32,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-01-10 01:56:32,086 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 151 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:32,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 204 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:56:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-10 01:56:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 162. [2025-01-10 01:56:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:56:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2025-01-10 01:56:32,104 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 43 [2025-01-10 01:56:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:32,104 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2025-01-10 01:56:32,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:56:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2025-01-10 01:56:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 01:56:32,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:32,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:56:32,114 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-01-10 01:56:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:56:32,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash -192255278, now seen corresponding path program 1 times [2025-01-10 01:56:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395316792] [2025-01-10 01:56:32,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:32,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:56:32,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:56:32,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:32,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:56:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395316792] [2025-01-10 01:56:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395316792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468371331] [2025-01-10 01:56:32,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:32,540 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-01-10 01:56:32,542 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-01-10 01:56:32,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:56:32,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:56:32,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:32,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:32,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:56:32,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:56:32,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:56:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468371331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:32,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 12 [2025-01-10 01:56:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745730434] [2025-01-10 01:56:32,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:32,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:56:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:32,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:56:32,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:56:32,717 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:32,827 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2025-01-10 01:56:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:56:32,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-01-10 01:56:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:32,830 INFO L225 Difference]: With dead ends: 202 [2025-01-10 01:56:32,830 INFO L226 Difference]: Without dead ends: 176 [2025-01-10 01:56:32,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:56:32,831 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:32,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-10 01:56:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2025-01-10 01:56:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 142 states have internal predecessors, (161), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:56:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2025-01-10 01:56:32,850 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 51 [2025-01-10 01:56:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:32,850 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2025-01-10 01:56:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2025-01-10 01:56:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:56:32,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:32,854 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:56:32,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:56:33,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:33,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:33,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:33,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1837557384, now seen corresponding path program 2 times [2025-01-10 01:56:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:33,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981746473] [2025-01-10 01:56:33,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:56:33,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:33,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:56:33,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:56:33,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:56:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-10 01:56:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981746473] [2025-01-10 01:56:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981746473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:33,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:33,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646907127] [2025-01-10 01:56:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:33,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:33,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:33,123 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:33,155 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2025-01-10 01:56:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-01-10 01:56:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:33,156 INFO L225 Difference]: With dead ends: 193 [2025-01-10 01:56:33,156 INFO L226 Difference]: Without dead ends: 167 [2025-01-10 01:56:33,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:33,157 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:33,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-10 01:56:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2025-01-10 01:56:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.1219512195121952) internal successors, (138), 123 states have internal predecessors, (138), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:56:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-01-10 01:56:33,177 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 56 [2025-01-10 01:56:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:33,177 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-01-10 01:56:33,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:56:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-01-10 01:56:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 01:56:33,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:33,178 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:56:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:56:33,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1845283291, now seen corresponding path program 1 times [2025-01-10 01:56:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746715697] [2025-01-10 01:56:33,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:33,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:56:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:56:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 90 proven. 7 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-10 01:56:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746715697] [2025-01-10 01:56:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746715697] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610223532] [2025-01-10 01:56:33,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:33,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:33,411 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-01-10 01:56:33,415 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-01-10 01:56:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:56:33,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:56:33,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:33,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:33,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:56:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-10 01:56:33,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-01-10 01:56:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610223532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:33,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-01-10 01:56:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900268267] [2025-01-10 01:56:33,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:56:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:33,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:56:33,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:56:33,789 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-10 01:56:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:34,128 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2025-01-10 01:56:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:56:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 103 [2025-01-10 01:56:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:34,129 INFO L225 Difference]: With dead ends: 242 [2025-01-10 01:56:34,129 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:56:34,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 186 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:56:34,130 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:34,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 355 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:56:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:56:34,131 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-01-10 01:56:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:56:34,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-01-10 01:56:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:34,131 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:56:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-10 01:56:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:56:34,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:56:34,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:56:34,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:56:34,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:56:34,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:56:34,142 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-01-10 01:56:34,334 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,SelfDestructingSolverStorable10 [2025-01-10 01:56:34,337 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:34,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:56:34,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:56:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:56:34 BoogieIcfgContainer [2025-01-10 01:56:34,535 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:56:34,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:56:34,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:56:34,535 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:56:34,536 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:28" (3/4) ... [2025-01-10 01:56:34,537 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:56:34,546 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:56:34,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:56:34,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:56:34,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:56:34,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:56:34,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:56:34,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:56:34,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:56:34,635 INFO L158 Benchmark]: Toolchain (without parser) took 6622.51ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 113.7MB in the end (delta: -678.7kB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.75ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.37ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 993.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: Boogie Preprocessor took 37.12ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: RCFGBuilder took 205.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 88.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:56:34,636 INFO L158 Benchmark]: TraceAbstraction took 6063.79ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 42.9MB in the end (delta: 45.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-01-10 01:56:34,638 INFO L158 Benchmark]: Witness Printer took 99.69ms. Allocated memory is still 142.6MB. Free memory was 42.9MB in the beginning and 113.7MB in the end (delta: -70.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:34,641 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.93ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.75ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.37ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 993.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.12ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 88.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6063.79ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 42.9MB in the end (delta: 45.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 99.69ms. Allocated memory is still 142.6MB. Free memory was 42.9MB in the beginning and 113.7MB in the end (delta: -70.8MB). 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: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1216 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1008 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 896 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 208 mSDtfsCounter, 896 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 394 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 156, 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, 11 MinimizatonAttempts, 109 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 1526 SizeOfPredicates, 34 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1169/1446 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((counter == 0) || (((counter == 5) || (counter < 5)) && (1 <= counter))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || ((counter <= 3) && (1 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:56:34,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE