./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.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/ldv-memsafety/memleaks_test18.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 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:38:53,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:38:53,303 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:38:53,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:38:53,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:38:53,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:38:53,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:38:53,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:38:53,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:38:53,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:38:53,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:38:53,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:38:53,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:38:53,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:38:53,345 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:38:53,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:38:53,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:38:53,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:38:53,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:38:53,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:38:53,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:38:53,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:53,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:53,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:53,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:38:53,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:38:53,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:38:53,349 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 -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2025-01-10 01:38:53,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:38:53,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:38:53,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:38:53,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:38:53,602 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:38:53,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2025-01-10 01:38:54,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982d0eebb/d2b5deb03f6f4d44969aad31e893d216/FLAG8b255f5e4 [2025-01-10 01:38:55,030 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:38:55,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2025-01-10 01:38:55,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982d0eebb/d2b5deb03f6f4d44969aad31e893d216/FLAG8b255f5e4 [2025-01-10 01:38:55,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982d0eebb/d2b5deb03f6f4d44969aad31e893d216 [2025-01-10 01:38:55,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:38:55,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:38:55,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:55,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:38:55,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:38:55,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139849bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55, skipping insertion in model container [2025-01-10 01:38:55,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:38:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:55,602 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:38:55,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:55,672 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:38:55,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55 WrapperNode [2025-01-10 01:38:55,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:55,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:55,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:38:55,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:38:55,679 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:38:55" (1/1) ... [2025-01-10 01:38:55,689 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:38:55" (1/1) ... [2025-01-10 01:38:55,699 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 45 [2025-01-10 01:38:55,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:55,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:38:55,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:38:55,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:38:55,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,723 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:38:55,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:38:55,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:38:55,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:38:55,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:38:55,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (1/1) ... [2025-01-10 01:38:55,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:55,759 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:38:55,764 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:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-10 01:38:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:38:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:38:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:38:55,867 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:38:55,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:38:55,979 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-10 01:38:55,980 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:38:55,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:38:55,990 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:38:55,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:55 BoogieIcfgContainer [2025-01-10 01:38:55,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:38:55,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:38:55,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:38:55,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:38:55,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:38:55" (1/3) ... [2025-01-10 01:38:55,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe5ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:55, skipping insertion in model container [2025-01-10 01:38:55,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:55" (2/3) ... [2025-01-10 01:38:55,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abe5ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:55, skipping insertion in model container [2025-01-10 01:38:55,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:55" (3/3) ... [2025-01-10 01:38:55,997 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test18.i [2025-01-10 01:38:56,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:38:56,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test18.i that has 2 procedures, 30 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 01:38:56,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:38:56,064 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;@5e58b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:38:56,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:38:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:38:56,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:56,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:56,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 403669741, now seen corresponding path program 1 times [2025-01-10 01:38:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802842889] [2025-01-10 01:38:56,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:56,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:38:56,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:38:56,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:56,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:56,285 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:38:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802842889] [2025-01-10 01:38:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802842889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:38:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677060685] [2025-01-10 01:38:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:56,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:56,302 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:38:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:56,367 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-01-10 01:38:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-10 01:38:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:56,373 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:38:56,373 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:38:56,375 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:38:56,376 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:56,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 72 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:38:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2025-01-10 01:38:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-10 01:38:56,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2025-01-10 01:38:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 01:38:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:38:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-10 01:38:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:38:56,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:56,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:56,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:38:56,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1215466795, now seen corresponding path program 1 times [2025-01-10 01:38:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976594581] [2025-01-10 01:38:56,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:56,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:38:56,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:38:56,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:56,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976594581] [2025-01-10 01:38:56,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976594581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:56,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:56,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466202926] [2025-01-10 01:38:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:56,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:56,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:56,547 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:56,587 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-01-10 01:38:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:56,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-01-10 01:38:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:56,588 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:38:56,588 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:38:56,588 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:38:56,589 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:56,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:38:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:38:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-01-10 01:38:56,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2025-01-10 01:38:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:56,595 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-01-10 01:38:56,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-01-10 01:38:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:56,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:56,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:56,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:38:56,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:56,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -899556561, now seen corresponding path program 1 times [2025-01-10 01:38:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933189026] [2025-01-10 01:38:56,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:56,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:56,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:56,678 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:38:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933189026] [2025-01-10 01:38:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933189026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:38:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990567946] [2025-01-10 01:38:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:38:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:38:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:56,680 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:56,700 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-01-10 01:38:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:38:56,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-10 01:38:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:56,701 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:38:56,702 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:38:56,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:38:56,702 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:56,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:38:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 01:38:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:38:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-01-10 01:38:56,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 21 [2025-01-10 01:38:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-10 01:38:56,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-01-10 01:38:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:56,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:56,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:38:56,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -897925070, now seen corresponding path program 1 times [2025-01-10 01:38:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630499210] [2025-01-10 01:38:56,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:56,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:56,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:56,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:56,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630499210] [2025-01-10 01:38:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630499210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191541768] [2025-01-10 01:38:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:56,832 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:38:56,833 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:38:56,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:56,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:56,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:38:56,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:56,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:38:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191541768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:38:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:38:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741271392] [2025-01-10 01:38:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:56,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:38:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:38:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:38:56,936 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:56,970 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-01-10 01:38:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:38:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 01:38:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:56,971 INFO L225 Difference]: With dead ends: 40 [2025-01-10 01:38:56,971 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:38:56,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:38:56,972 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:56,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:38:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:38:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:38:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-01-10 01:38:56,975 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2025-01-10 01:38:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:56,975 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-10 01:38:56,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-01-10 01:38:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:56,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:56,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:56,982 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:38:57,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:57,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1587956272, now seen corresponding path program 1 times [2025-01-10 01:38:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872380706] [2025-01-10 01:38:57,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:57,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872380706] [2025-01-10 01:38:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872380706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:38:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768864201] [2025-01-10 01:38:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:57,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:57,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:57,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:57,230 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:57,266 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-01-10 01:38:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-10 01:38:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:57,267 INFO L225 Difference]: With dead ends: 44 [2025-01-10 01:38:57,268 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:38:57,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:38:57,268 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:57,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:38:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-01-10 01:38:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:38:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-01-10 01:38:57,272 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2025-01-10 01:38:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-01-10 01:38:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:38:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-01-10 01:38:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:38:57,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:57,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:57,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:38:57,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2065873329, now seen corresponding path program 1 times [2025-01-10 01:38:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756350235] [2025-01-10 01:38:57,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:57,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:57,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:57,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:57,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756350235] [2025-01-10 01:38:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756350235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:57,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977457639] [2025-01-10 01:38:57,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:57,340 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:38:57,341 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:38:57,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:57,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:57,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:38:57,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:38:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977457639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:57,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:38:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:38:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408908344] [2025-01-10 01:38:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:57,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:38:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:57,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:38:57,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:38:57,401 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:57,410 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-01-10 01:38:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:38:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-10 01:38:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:57,411 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:38:57,411 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:38:57,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:38:57,412 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:57,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:38:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:38:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:38:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-01-10 01:38:57,415 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 22 [2025-01-10 01:38:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-01-10 01:38:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-01-10 01:38:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:38:57,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:57,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:57,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:38:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:57,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1029376207, now seen corresponding path program 1 times [2025-01-10 01:38:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464917643] [2025-01-10 01:38:57,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:38:57,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:38:57,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464917643] [2025-01-10 01:38:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464917643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:38:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611168522] [2025-01-10 01:38:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:38:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:57,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:38:57,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:57,658 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:57,668 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-01-10 01:38:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:38:57,669 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-10 01:38:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:57,669 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:38:57,670 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:38:57,670 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:38:57,671 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:57,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:38:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:38:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:38:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-10 01:38:57,678 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 24 [2025-01-10 01:38:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:57,678 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-10 01:38:57,678 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:38:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-10 01:38:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:38:57,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:57,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:57,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:38:57,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:57,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1845891272, now seen corresponding path program 1 times [2025-01-10 01:38:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127524994] [2025-01-10 01:38:57,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:57,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:38:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:38:57,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127524994] [2025-01-10 01:38:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127524994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132243988] [2025-01-10 01:38:57,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:57,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:57,783 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:38:57,786 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:38:57,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:38:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:38:57,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:57,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:57,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:38:57,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:38:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132243988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:57,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:38:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009683626] [2025-01-10 01:38:57,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:38:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:57,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:38:57,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:38:57,969 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:38:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:58,048 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2025-01-10 01:38:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:38:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 25 [2025-01-10 01:38:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:58,050 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:38:58,050 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:38:58,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:38:58,050 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:58,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 88 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:38:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-01-10 01:38:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:38:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-01-10 01:38:58,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2025-01-10 01:38:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:58,055 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-01-10 01:38:58,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:38:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-01-10 01:38:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:38:58,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:58,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:58,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:38:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:58,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 573522100, now seen corresponding path program 1 times [2025-01-10 01:38:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234426599] [2025-01-10 01:38:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:58,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:38:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:38:58,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234426599] [2025-01-10 01:38:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234426599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138439093] [2025-01-10 01:38:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:58,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:58,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:58,337 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:38:58,338 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:38:58,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:38:58,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:38:58,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:58,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:58,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:38:58,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:58,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138439093] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:58,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:58,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:38:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591003338] [2025-01-10 01:38:58,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:58,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:38:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:58,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:38:58,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:38:58,490 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:38:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:58,563 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-01-10 01:38:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:38:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2025-01-10 01:38:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:58,565 INFO L225 Difference]: With dead ends: 63 [2025-01-10 01:38:58,565 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 01:38:58,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:38:58,565 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:58,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 01:38:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-01-10 01:38:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 44 states have internal predecessors, (55), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 01:38:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2025-01-10 01:38:58,575 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 29 [2025-01-10 01:38:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:58,575 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2025-01-10 01:38:58,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:38:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2025-01-10 01:38:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:38:58,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:58,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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:38:58,583 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:38:58,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,SelfDestructingSolverStorable8 [2025-01-10 01:38:58,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:58,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash 169947572, now seen corresponding path program 1 times [2025-01-10 01:38:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361638963] [2025-01-10 01:38:58,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:58,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:38:58,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:38:58,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:58,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361638963] [2025-01-10 01:38:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361638963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093508100] [2025-01-10 01:38:58,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:58,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:58,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:58,847 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:38:58,848 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:38:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:38:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:38:58,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:58,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:58,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:38:58,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:58,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:38:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093508100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:59,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:38:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047667295] [2025-01-10 01:38:59,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:38:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:38:59,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:38:59,002 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:38:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:59,049 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-01-10 01:38:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:38:59,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2025-01-10 01:38:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:59,050 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:38:59,050 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:38:59,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:38:59,052 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:38:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-01-10 01:38:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:38:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-01-10 01:38:59,058 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2025-01-10 01:38:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-01-10 01:38:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:38:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-01-10 01:38:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 01:38:59,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:59,061 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:59,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:38:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:38:59,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:38:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1974465533, now seen corresponding path program 2 times [2025-01-10 01:38:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726173714] [2025-01-10 01:38:59,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:38:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:59,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:38:59,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:38:59,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:38:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-10 01:38:59,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:59,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726173714] [2025-01-10 01:38:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726173714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:59,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967401954] [2025-01-10 01:38:59,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:38:59,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:59,392 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:38:59,394 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:38:59,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:38:59,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:38:59,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:38:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:59,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:38:59,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:38:59,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:38:59,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967401954] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:59,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:59,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 24 [2025-01-10 01:38:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559504110] [2025-01-10 01:38:59,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:59,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:38:59,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:59,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:38:59,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:38:59,690 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 01:38:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:59,829 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-01-10 01:38:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:38:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 59 [2025-01-10 01:38:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:59,830 INFO L225 Difference]: With dead ends: 47 [2025-01-10 01:38:59,830 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:38:59,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 01:38:59,831 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:59,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:38:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:38:59,832 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:38:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:38:59,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2025-01-10 01:38:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:59,832 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:38:59,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 01:38:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:38:59,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:38:59,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:38:59,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:39:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:39:00,039 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:39:00,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:39:00,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:39:00,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:39:00 BoogieIcfgContainer [2025-01-10 01:39:00,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:39:00,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:39:00,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:39:00,127 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:39:00,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:55" (3/4) ... [2025-01-10 01:39:00,129 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:39:00,132 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-10 01:39:00,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 01:39:00,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:39:00,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:39:00,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:39:00,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:39:00,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:39:00,199 INFO L158 Benchmark]: Toolchain (without parser) took 4889.47ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 123.3MB in the end (delta: -27.4kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2025-01-10 01:39:00,199 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:39:00,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.33ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 101.3MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:39:00,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.89ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:39:00,200 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:39:00,200 INFO L158 Benchmark]: RCFGBuilder took 257.96ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:39:00,201 INFO L158 Benchmark]: TraceAbstraction took 4134.36ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 129.2MB in the end (delta: -43.9MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2025-01-10 01:39:00,201 INFO L158 Benchmark]: Witness Printer took 72.27ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 123.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:39:00,202 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.25ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.33ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 101.3MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.89ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.96ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4134.36ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 129.2MB in the end (delta: -43.9MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Witness Printer took 72.27ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 123.3MB in the end (delta: 6.0MB). 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: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 828 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 242 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 339/514 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 6 specifications checked. All of them hold - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((10 == len) && (1 <= i)) && (i <= 2147483642)) || ((10 == len) && (i == 0))) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (j < 2147483649) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:39:00,216 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