./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.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/array-examples/sorting_bubblesort_ground-2.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 2719a9efd2165050483c20571c85746fdd7204d074459e12a38b31692a3fffb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:18:27,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:18:27,946 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:18:27,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:18:27,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:18:27,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:18:27,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:18:27,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:18:27,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:18:27,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:18:27,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:18:27,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:18:27,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:18:27,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:18:27,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:18:27,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:18:27,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:27,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:27,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:18:27,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:18:27,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:18:27,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:18:27,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:18:27,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:18:27,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:18:27,969 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 -> 2719a9efd2165050483c20571c85746fdd7204d074459e12a38b31692a3fffb0 [2025-01-10 01:18:28,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:18:28,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:18:28,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:18:28,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:18:28,149 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:18:28,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i [2025-01-10 01:18:29,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec41a4296/74fe0b09e21141f1a35437441628c6ba/FLAGc34290c0e [2025-01-10 01:18:29,704 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:18:29,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i [2025-01-10 01:18:29,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec41a4296/74fe0b09e21141f1a35437441628c6ba/FLAGc34290c0e [2025-01-10 01:18:29,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec41a4296/74fe0b09e21141f1a35437441628c6ba [2025-01-10 01:18:29,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:18:29,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:18:29,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:29,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:18:29,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:18:29,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73abb723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29, skipping insertion in model container [2025-01-10 01:18:29,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:18:30,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:30,223 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:18:30,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:30,283 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:18:30,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30 WrapperNode [2025-01-10 01:18:30,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:30,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:30,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:18:30,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:18:30,299 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:18:30" (1/1) ... [2025-01-10 01:18:30,316 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:18:30" (1/1) ... [2025-01-10 01:18:30,345 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2025-01-10 01:18:30,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:30,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:18:30,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:18:30,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:18:30,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,386 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:18:30,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:18:30,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:18:30,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:18:30,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:18:30,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (1/1) ... [2025-01-10 01:18:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:30,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:30,476 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:18:30,480 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:18:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:18:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:18:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:18:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:18:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:18:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:18:30,593 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:18:30,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:18:30,813 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-01-10 01:18:30,814 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:18:30,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:18:30,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:18:30,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:30 BoogieIcfgContainer [2025-01-10 01:18:30,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:18:30,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:18:30,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:18:30,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:18:30,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:18:29" (1/3) ... [2025-01-10 01:18:30,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75162737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:30, skipping insertion in model container [2025-01-10 01:18:30,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:30" (2/3) ... [2025-01-10 01:18:30,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75162737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:30, skipping insertion in model container [2025-01-10 01:18:30,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:30" (3/3) ... [2025-01-10 01:18:30,828 INFO L128 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-2.i [2025-01-10 01:18:30,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:18:30,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sorting_bubblesort_ground-2.i that has 1 procedures, 48 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-01-10 01:18:30,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:18:30,881 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;@3e00cd7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:18:30,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 01:18:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 47 states have internal predecessors, (55), 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:18:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:18:30,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:30,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:18:30,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:30,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:18:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:30,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177208260] [2025-01-10 01:18:30,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:18:30,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:18:30,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,025 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:18:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177208260] [2025-01-10 01:18:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177208260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991714825] [2025-01-10 01:18:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:31,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:31,043 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:18:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,072 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-01-10 01:18:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:18:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,078 INFO L225 Difference]: With dead ends: 93 [2025-01-10 01:18:31,078 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:18:31,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:31,082 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:18:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 01:18:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 44 states have internal predecessors, (50), 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:18:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-01-10 01:18:31,103 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 4 [2025-01-10 01:18:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,103 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-01-10 01:18:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:18:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-01-10 01:18:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:18:31,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,104 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:18:31,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:18:31,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1805857894, now seen corresponding path program 1 times [2025-01-10 01:18:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742777324] [2025-01-10 01:18:31,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:31,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742777324] [2025-01-10 01:18:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742777324] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745926614] [2025-01-10 01:18:31,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:31,189 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:18:31,191 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:18:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:31,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:31,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:18:31,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:31,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745926614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:18:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684193691] [2025-01-10 01:18:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:18:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:18:31,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:18:31,278 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,311 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-01-10 01:18:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:18:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:18:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,316 INFO L225 Difference]: With dead ends: 45 [2025-01-10 01:18:31,316 INFO L226 Difference]: Without dead ends: 44 [2025-01-10 01:18:31,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:18:31,317 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-10 01:18:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-10 01:18:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 43 states have internal predecessors, (49), 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:18:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-01-10 01:18:31,326 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 7 [2025-01-10 01:18:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-01-10 01:18:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-01-10 01:18:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:18:31,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:18:31,337 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:18:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 147019906, now seen corresponding path program 1 times [2025-01-10 01:18:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-01-10 01:18:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:18:31,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:18:31,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-01-10 01:18:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724811054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396389437] [2025-01-10 01:18:31,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:31,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:31,613 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,625 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-01-10 01:18:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:18:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,627 INFO L225 Difference]: With dead ends: 44 [2025-01-10 01:18:31,627 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 01:18:31,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:31,628 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 01:18:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-01-10 01:18:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 40 states have internal predecessors, (46), 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:18:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-01-10 01:18:31,635 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 8 [2025-01-10 01:18:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,635 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-01-10 01:18:31,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-01-10 01:18:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:18:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:31,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:18:31,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:31,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 262836586, now seen corresponding path program 1 times [2025-01-10 01:18:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-01-10 01:18:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:18:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:18:31,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-01-10 01:18:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239770442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455686320] [2025-01-10 01:18:31,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:31,721 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:18:31,722 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:18:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:18:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:18:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:31,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455686320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951877097] [2025-01-10 01:18:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:31,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:31,765 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:18:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,790 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-01-10 01:18:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:31,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:18:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,791 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:18:31,791 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:18:31,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:31,791 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:18:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:18:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-10 01:18:31,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 9 [2025-01-10 01:18:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-10 01:18:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:18:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-10 01:18:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:18:31,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:31,801 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:18:31,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:31,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 262866376, now seen corresponding path program 1 times [2025-01-10 01:18:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021720895] [2025-01-10 01:18:31,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:18:32,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:18:32,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021720895] [2025-01-10 01:18:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021720895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286578111] [2025-01-10 01:18:32,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:32,047 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:18:32,051 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:18:32,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:18:32,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:18:32,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:32,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:32,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286578111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:32,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-10 01:18:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819814296] [2025-01-10 01:18:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:32,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:32,098 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:18:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:32,108 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-01-10 01:18:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:18:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:32,109 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:18:32,109 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:18:32,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:32,110 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:32,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:18:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2025-01-10 01:18:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 43 states have internal predecessors, (53), 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:18:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-01-10 01:18:32,113 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 9 [2025-01-10 01:18:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:32,113 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-01-10 01:18:32,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:18:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-01-10 01:18:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:18:32,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:32,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:32,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:18:32,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -442000372, now seen corresponding path program 1 times [2025-01-10 01:18:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504658954] [2025-01-10 01:18:32,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:18:32,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:18:32,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:32,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504658954] [2025-01-10 01:18:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504658954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710329590] [2025-01-10 01:18:32,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:32,362 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:18:32,363 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:18:32,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:18:32,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:18:32,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:32,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:32,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710329590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118484570] [2025-01-10 01:18:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:32,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:32,477 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:18:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:32,560 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2025-01-10 01:18:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:18:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:32,561 INFO L225 Difference]: With dead ends: 94 [2025-01-10 01:18:32,561 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:18:32,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:32,561 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:32,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:18:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 01:18:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.434782608695652) internal successors, (66), 55 states have internal predecessors, (66), 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:18:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-01-10 01:18:32,576 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 10 [2025-01-10 01:18:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-01-10 01:18:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:18:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-01-10 01:18:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:18:32,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:32,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:32,589 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:18:32,776 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,SelfDestructingSolverStorable5 [2025-01-10 01:18:32,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 161349339, now seen corresponding path program 1 times [2025-01-10 01:18:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438015543] [2025-01-10 01:18:32,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:18:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:18:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438015543] [2025-01-10 01:18:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438015543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716529317] [2025-01-10 01:18:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:32,894 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:18:32,895 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:18:32,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:18:32,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:18:32,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:32,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:32,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716529317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659550688] [2025-01-10 01:18:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:32,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:32,952 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:18:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:33,008 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-01-10 01:18:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-01-10 01:18:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:33,009 INFO L225 Difference]: With dead ends: 56 [2025-01-10 01:18:33,009 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:18:33,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:33,010 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:33,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:18:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2025-01-10 01:18:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-01-10 01:18:33,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 16 [2025-01-10 01:18:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:33,020 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 01:18:33,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:18:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-01-10 01:18:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:18:33,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:33,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:33,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:18:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:33,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 707601149, now seen corresponding path program 1 times [2025-01-10 01:18:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817506499] [2025-01-10 01:18:33,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:33,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:18:33,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:18:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817506499] [2025-01-10 01:18:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817506499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102467637] [2025-01-10 01:18:33,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:33,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:33,328 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:18:33,330 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:18:33,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:18:33,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:18:33,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:33,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:33,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102467637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930399740] [2025-01-10 01:18:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:33,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:33,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:33,372 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:18:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:33,388 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-01-10 01:18:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-01-10 01:18:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:33,389 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:18:33,389 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:18:33,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:33,389 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:33,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:18:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2025-01-10 01:18:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 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:18:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-01-10 01:18:33,393 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 17 [2025-01-10 01:18:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:33,393 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-01-10 01:18:33,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:18:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-01-10 01:18:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:18:33,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:33,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:33,402 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:18:33,594 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,SelfDestructingSolverStorable7 [2025-01-10 01:18:33,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 460799223, now seen corresponding path program 1 times [2025-01-10 01:18:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432163700] [2025-01-10 01:18:33,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:33,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:18:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:18:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:33,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:33,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432163700] [2025-01-10 01:18:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432163700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157517499] [2025-01-10 01:18:33,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:33,670 INFO L229 MonitoredProcess]: Starting monitored process 8 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:18:33,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:18:33,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:18:33,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:18:33,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:33,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:18:33,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157517499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591927618] [2025-01-10 01:18:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:33,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:33,749 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:18:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:33,763 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-01-10 01:18:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-01-10 01:18:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:33,764 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:18:33,764 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:18:33,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:33,765 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:33,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:18:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-01-10 01:18:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-01-10 01:18:33,771 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 18 [2025-01-10 01:18:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-01-10 01:18:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:18:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-01-10 01:18:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:18:33,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:33,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:33,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:18:33,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:33,974 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:33,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash 446425337, now seen corresponding path program 1 times [2025-01-10 01:18:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-01-10 01:18:33,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:18:33,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:18:33,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:34,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-01-10 01:18:34,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89358647] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:34,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985822166] [2025-01-10 01:18:34,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:34,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:34,015 INFO L229 MonitoredProcess]: Starting monitored process 9 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:18:34,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:18:34,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:18:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:18:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:34,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:18:34,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:34,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:34,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985822166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:34,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:34,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:18:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952024749] [2025-01-10 01:18:34,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:18:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:34,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:18:34,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:18:34,098 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:18:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:34,116 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2025-01-10 01:18:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:18:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 20 [2025-01-10 01:18:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:34,119 INFO L225 Difference]: With dead ends: 88 [2025-01-10 01:18:34,119 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:18:34,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:18:34,120 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:34,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:18:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:18:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 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:18:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-01-10 01:18:34,123 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 20 [2025-01-10 01:18:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:34,123 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-01-10 01:18:34,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:18:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-01-10 01:18:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:18:34,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:34,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:34,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:18:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1065644615, now seen corresponding path program 2 times [2025-01-10 01:18:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138782501] [2025-01-10 01:18:34,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:34,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:18:34,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 26 statements. [2025-01-10 01:18:34,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:34,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:18:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138782501] [2025-01-10 01:18:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138782501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:34,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:18:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029245060] [2025-01-10 01:18:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:34,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:34,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:34,358 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:18:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:34,382 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-01-10 01:18:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:34,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 01:18:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:34,383 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:18:34,383 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:18:34,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:34,384 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:34,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:18:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-01-10 01:18:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 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:18:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-01-10 01:18:34,387 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2025-01-10 01:18:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:34,387 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-01-10 01:18:34,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:18:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-01-10 01:18:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:18:34,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:34,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:34,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:18:34,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:34,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1882920249, now seen corresponding path program 1 times [2025-01-10 01:18:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:34,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854464684] [2025-01-10 01:18:34,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:34,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:34,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:18:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:18:34,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:34,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:18:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854464684] [2025-01-10 01:18:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854464684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305872183] [2025-01-10 01:18:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:34,432 INFO L229 MonitoredProcess]: Starting monitored process 10 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:18:34,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:18:34,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:18:34,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:18:34,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:34,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:18:34,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:34,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:34,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305872183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:34,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:34,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2025-01-10 01:18:34,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532422203] [2025-01-10 01:18:34,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:34,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:18:34,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:34,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:18:34,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:18:34,634 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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:18:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:34,707 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2025-01-10 01:18:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:18:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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 28 [2025-01-10 01:18:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:34,708 INFO L225 Difference]: With dead ends: 129 [2025-01-10 01:18:34,708 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 01:18:34,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:18:34,709 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:34,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 01:18:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2025-01-10 01:18:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2) internal successors, (84), 75 states have internal predecessors, (84), 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:18:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-01-10 01:18:34,713 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 28 [2025-01-10 01:18:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:34,713 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-01-10 01:18:34,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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:18:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-01-10 01:18:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 01:18:34,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:34,714 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:34,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:18:34,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:34,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 76421270, now seen corresponding path program 2 times [2025-01-10 01:18:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:34,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490647096] [2025-01-10 01:18:34,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:34,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 01:18:34,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 46 statements. [2025-01-10 01:18:34,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:34,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 01:18:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490647096] [2025-01-10 01:18:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490647096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:18:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985356238] [2025-01-10 01:18:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:35,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:18:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:35,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:18:35,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:35,007 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:35,053 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-01-10 01:18:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:18:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-10 01:18:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:35,054 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:18:35,054 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:18:35,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:35,054 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:35,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:18:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-01-10 01:18:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 80 states have internal predecessors, (91), 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:18:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-01-10 01:18:35,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 46 [2025-01-10 01:18:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:35,065 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-01-10 01:18:35,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-01-10 01:18:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:18:35,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:35,065 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:35,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:18:35,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:35,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1925907818, now seen corresponding path program 1 times [2025-01-10 01:18:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:35,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548334813] [2025-01-10 01:18:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:35,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:18:35,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:18:35,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:35,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 01:18:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:35,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548334813] [2025-01-10 01:18:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548334813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653668110] [2025-01-10 01:18:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:35,135 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:18:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:35,149 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-01-10 01:18:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 47 [2025-01-10 01:18:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:35,151 INFO L225 Difference]: With dead ends: 81 [2025-01-10 01:18:35,151 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 01:18:35,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:35,152 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:35,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 01:18:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 01:18:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 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:18:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-01-10 01:18:35,157 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 47 [2025-01-10 01:18:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:35,158 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-01-10 01:18:35,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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:18:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-01-10 01:18:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:18:35,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:35,161 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:18:35,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 333495000, now seen corresponding path program 1 times [2025-01-10 01:18:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:35,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75145891] [2025-01-10 01:18:35,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:18:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:18:35,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:35,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:18:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75145891] [2025-01-10 01:18:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75145891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968684497] [2025-01-10 01:18:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:35,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:35,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:35,231 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:18:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:35,255 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-01-10 01:18:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 49 [2025-01-10 01:18:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:35,256 INFO L225 Difference]: With dead ends: 84 [2025-01-10 01:18:35,256 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:18:35,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:35,256 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:35,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:18:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-10 01:18:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 81 states have internal predecessors, (91), 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:18:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-01-10 01:18:35,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 49 [2025-01-10 01:18:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:35,261 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-01-10 01:18:35,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:18:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-01-10 01:18:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 01:18:35,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:35,263 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:35,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:18:35,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:35,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 890301468, now seen corresponding path program 1 times [2025-01-10 01:18:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-01-10 01:18:35,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:35,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:18:35,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:18:35,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:35,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:18:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733544431] [2025-01-10 01:18:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733544431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512852567] [2025-01-10 01:18:35,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:35,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:35,369 INFO L229 MonitoredProcess]: Starting monitored process 11 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:18:35,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:18:35,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:18:35,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:18:35,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:35,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:18:35,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:18:35,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:18:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512852567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:35,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:35,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 35 [2025-01-10 01:18:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984104470] [2025-01-10 01:18:35,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:18:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:35,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:18:35,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:18:35,941 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 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:18:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:36,060 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2025-01-10 01:18:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 01:18:36,061 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 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 52 [2025-01-10 01:18:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:36,061 INFO L225 Difference]: With dead ends: 173 [2025-01-10 01:18:36,061 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 01:18:36,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:18:36,063 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 265 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 01:18:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2025-01-10 01:18:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 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:18:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2025-01-10 01:18:36,072 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 52 [2025-01-10 01:18:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2025-01-10 01:18:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 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:18:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2025-01-10 01:18:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 01:18:36,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:36,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:36,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:18:36,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:18:36,274 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash -460864328, now seen corresponding path program 1 times [2025-01-10 01:18:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850602877] [2025-01-10 01:18:36,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:36,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 01:18:36,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 01:18:36,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-01-10 01:18:36,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850602877] [2025-01-10 01:18:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850602877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:36,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323869019] [2025-01-10 01:18:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:36,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:36,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:36,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:36,349 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:18:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:36,363 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-01-10 01:18:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 77 [2025-01-10 01:18:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:36,365 INFO L225 Difference]: With dead ends: 108 [2025-01-10 01:18:36,365 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 01:18:36,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:36,365 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:36,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 01:18:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-10 01:18:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 106 states have internal predecessors, (116), 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:18:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-01-10 01:18:36,372 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 77 [2025-01-10 01:18:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:36,373 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-01-10 01:18:36,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:18:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-01-10 01:18:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 01:18:36,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:36,374 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:18:36,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:36,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash -508984198, now seen corresponding path program 1 times [2025-01-10 01:18:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579621407] [2025-01-10 01:18:36,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:36,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 01:18:36,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 01:18:36,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-10 01:18:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:36,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579621407] [2025-01-10 01:18:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579621407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:36,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486718180] [2025-01-10 01:18:36,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:36,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:36,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:36,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:36,464 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:18:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:36,479 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2025-01-10 01:18:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:36,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 79 [2025-01-10 01:18:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:36,480 INFO L225 Difference]: With dead ends: 107 [2025-01-10 01:18:36,480 INFO L226 Difference]: Without dead ends: 105 [2025-01-10 01:18:36,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:36,480 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:36,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-10 01:18:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-01-10 01:18:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.108910891089109) internal successors, (112), 102 states have internal predecessors, (112), 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:18:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-01-10 01:18:36,484 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 79 [2025-01-10 01:18:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-01-10 01:18:36,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:18:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-01-10 01:18:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 01:18:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:36,485 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:18:36,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1401359160, now seen corresponding path program 1 times [2025-01-10 01:18:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-01-10 01:18:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:36,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 01:18:36,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:18:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-01-10 01:18:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-01-10 01:18:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119293217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360569968] [2025-01-10 01:18:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:36,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:36,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:36,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:36,542 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:36,557 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-01-10 01:18:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-10 01:18:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:36,558 INFO L225 Difference]: With dead ends: 103 [2025-01-10 01:18:36,558 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 01:18:36,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:36,558 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:36,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 01:18:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-01-10 01:18:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.101010101010101) internal successors, (109), 99 states have internal predecessors, (109), 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:18:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-01-10 01:18:36,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 80 [2025-01-10 01:18:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:36,562 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-01-10 01:18:36,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-01-10 01:18:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 01:18:36,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:36,563 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:18:36,564 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 491795784, now seen corresponding path program 1 times [2025-01-10 01:18:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:36,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078355133] [2025-01-10 01:18:36,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:36,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 01:18:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 01:18:36,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-10 01:18:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078355133] [2025-01-10 01:18:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078355133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871313367] [2025-01-10 01:18:36,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:36,665 INFO L229 MonitoredProcess]: Starting monitored process 12 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:18:36,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:18:36,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 01:18:36,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 01:18:36,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:18:36,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:18:37,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:18:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871313367] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:38,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-01-10 01:18:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219287163] [2025-01-10 01:18:38,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:38,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-01-10 01:18:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-01-10 01:18:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=3357, Unknown=0, NotChecked=0, Total=4422 [2025-01-10 01:18:38,059 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 67 states, 67 states have (on average 2.014925373134328) internal successors, (135), 67 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:38,242 INFO L93 Difference]: Finished difference Result 230 states and 269 transitions. [2025-01-10 01:18:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-01-10 01:18:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.014925373134328) internal successors, (135), 67 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-10 01:18:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:38,244 INFO L225 Difference]: With dead ends: 230 [2025-01-10 01:18:38,244 INFO L226 Difference]: Without dead ends: 178 [2025-01-10 01:18:38,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1065, Invalid=3357, Unknown=0, NotChecked=0, Total=4422 [2025-01-10 01:18:38,246 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:38,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 192 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-10 01:18:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2025-01-10 01:18:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.0736196319018405) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2025-01-10 01:18:38,255 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 81 [2025-01-10 01:18:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:38,256 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2025-01-10 01:18:38,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.014925373134328) internal successors, (135), 67 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2025-01-10 01:18:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 01:18:38,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:38,257 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:38,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:18:38,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:38,461 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:18:38,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash -269180199, now seen corresponding path program 2 times [2025-01-10 01:18:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771896871] [2025-01-10 01:18:38,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:38,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-01-10 01:18:38,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 135 statements. [2025-01-10 01:18:38,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2025-01-10 01:18:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771896871] [2025-01-10 01:18:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771896871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:38,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:18:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205943749] [2025-01-10 01:18:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:38,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:18:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:38,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:18:38,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:18:38,504 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:38,531 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2025-01-10 01:18:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:18:38,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-01-10 01:18:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:38,532 INFO L225 Difference]: With dead ends: 164 [2025-01-10 01:18:38,532 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:18:38,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:38,532 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:38,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:18:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:18:38,533 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:18:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:18:38,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2025-01-10 01:18:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:18:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:18:38,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 01:18:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 01:18:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 01:18:38,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:18:38,541 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:38,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:18:38,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:18:38,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:18:38 BoogieIcfgContainer [2025-01-10 01:18:38,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:18:38,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:18:38,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:18:38,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:18:38,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:30" (3/4) ... [2025-01-10 01:18:38,605 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:18:38,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:18:38,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:18:38,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:18:38,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:18:38,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:18:38,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:18:38,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:18:38,683 INFO L158 Benchmark]: Toolchain (without parser) took 8755.26ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 111.4MB in the beginning and 66.3MB in the end (delta: 45.1MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,683 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:38,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.93ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:38,683 INFO L158 Benchmark]: Boogie Preprocessor took 68.02ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,683 INFO L158 Benchmark]: RCFGBuilder took 404.56ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 84.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,684 INFO L158 Benchmark]: TraceAbstraction took 7780.03ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 84.1MB in the beginning and 71.9MB in the end (delta: 12.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,684 INFO L158 Benchmark]: Witness Printer took 79.13ms. Allocated memory is still 192.9MB. Free memory was 71.9MB in the beginning and 66.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:38,687 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.93ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.02ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 404.56ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 84.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7780.03ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 84.1MB in the beginning and 71.9MB in the end (delta: 12.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 79.13ms. Allocated memory is still 192.9MB. Free memory was 71.9MB in the beginning and 66.3MB in the end (delta: 5.6MB). 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 21, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 2122 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1458 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 905 IncrementalHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 664 mSDtfsCounter, 905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=20, InterpolantAutomatonStates: 188, 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, 21 MinimizatonAttempts, 85 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1085 NumberOfCodeBlocks, 909 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 36 InterpolantComputations, 17 PerfectInterpolantSequences, 3273/4119 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 16 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (0 < (2147483650 + x)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 < i) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((0 <= (2147483649 + x)) && (x <= 99999)) && (0 <= (y + 2147483648))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((0 < j) || (j == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:18:38,704 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