./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:36:18,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:36:18,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:36:18,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:36:18,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:36:18,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:36:18,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:36:18,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:36:18,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:36:18,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:36:18,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:36:18,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:36:18,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:36:18,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:36:18,878 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:36:18,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:36:18,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:36:18,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:36:18,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:36:18,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:36:18,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:36:18,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:36:18,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:36:18,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:36:18,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:36:18,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:36:18,882 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2025-02-08 13:36:19,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:36:19,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:36:19,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:36:19,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:36:19,173 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:36:19,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2025-02-08 13:36:20,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd4215fcd/e4e0c44934d8499488ac35ea11c34bd1/FLAG4537513d5 [2025-02-08 13:36:20,765 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:36:20,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2025-02-08 13:36:20,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd4215fcd/e4e0c44934d8499488ac35ea11c34bd1/FLAG4537513d5 [2025-02-08 13:36:20,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd4215fcd/e4e0c44934d8499488ac35ea11c34bd1 [2025-02-08 13:36:20,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:36:20,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:36:20,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:36:20,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:36:20,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:36:20,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:36:20" (1/1) ... [2025-02-08 13:36:20,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391d9de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:20, skipping insertion in model container [2025-02-08 13:36:20,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:36:20" (1/1) ... [2025-02-08 13:36:20,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:36:21,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:36:21,307 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:36:21,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:36:21,464 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:36:21,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21 WrapperNode [2025-02-08 13:36:21,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:36:21,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:36:21,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:36:21,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:36:21,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,558 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-02-08 13:36:21,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:36:21,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:36:21,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:36:21,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:36:21,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,749 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-02-08 13:36:21,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:36:21,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:36:21,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:36:21,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:36:21,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (1/1) ... [2025-02-08 13:36:21,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:36:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:21,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:36:21,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:36:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:36:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:36:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:36:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:36:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:36:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:36:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:36:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:36:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:36:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:36:21,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:36:22,130 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:36:22,132 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:36:23,820 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2025-02-08 13:36:23,821 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:36:23,883 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:36:23,883 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 13:36:23,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:36:23 BoogieIcfgContainer [2025-02-08 13:36:23,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:36:23,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:36:23,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:36:23,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:36:23,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:36:20" (1/3) ... [2025-02-08 13:36:23,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114a4538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:36:23, skipping insertion in model container [2025-02-08 13:36:23,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:36:21" (2/3) ... [2025-02-08 13:36:23,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114a4538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:36:23, skipping insertion in model container [2025-02-08 13:36:23,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:36:23" (3/3) ... [2025-02-08 13:36:23,894 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2025-02-08 13:36:23,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:36:23,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test4-3.i that has 4 procedures, 491 locations, 1 initial locations, 45 loop locations, and 6 error locations. [2025-02-08 13:36:23,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:36:23,986 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;@42effdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:36:23,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:36:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 487 states, 461 states have (on average 1.6268980477223427) internal successors, (750), 477 states have internal predecessors, (750), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 13:36:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 13:36:23,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:23,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 13:36:23,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:24,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash 26151494, now seen corresponding path program 1 times [2025-02-08 13:36:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449178423] [2025-02-08 13:36:24,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 13:36:24,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 13:36:24,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:36:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449178423] [2025-02-08 13:36:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449178423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:36:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214754676] [2025-02-08 13:36:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:24,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:36:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:24,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:36:24,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:24,220 INFO L87 Difference]: Start difference. First operand has 487 states, 461 states have (on average 1.6268980477223427) internal successors, (750), 477 states have internal predecessors, (750), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:24,489 INFO L93 Difference]: Finished difference Result 1353 states and 2192 transitions. [2025-02-08 13:36:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:36:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 13:36:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:24,501 INFO L225 Difference]: With dead ends: 1353 [2025-02-08 13:36:24,502 INFO L226 Difference]: Without dead ends: 789 [2025-02-08 13:36:24,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:24,508 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 543 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:24,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1337 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:36:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-08 13:36:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 408. [2025-02-08 13:36:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 396 states have (on average 1.4419191919191918) internal successors, (571), 400 states have internal predecessors, (571), 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-02-08 13:36:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 583 transitions. [2025-02-08 13:36:24,578 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 583 transitions. Word has length 4 [2025-02-08 13:36:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:24,578 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 583 transitions. [2025-02-08 13:36:24,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 583 transitions. [2025-02-08 13:36:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:36:24,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:24,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:36:24,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:36:24,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:24,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -3600739, now seen corresponding path program 1 times [2025-02-08 13:36:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101723794] [2025-02-08 13:36:24,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:24,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:36:24,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:36:24,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:24,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:36:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5211776] [2025-02-08 13:36:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:24,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:24,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:36:24,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:36:24,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:36:24,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:24,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:24,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:36:24,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:36:24,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101723794] [2025-02-08 13:36:24,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:36:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5211776] [2025-02-08 13:36:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5211776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:24,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:24,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:36:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046566127] [2025-02-08 13:36:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:24,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:36:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:24,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:36:24,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:24,811 INFO L87 Difference]: Start difference. First operand 408 states and 583 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:24,978 INFO L93 Difference]: Finished difference Result 790 states and 1139 transitions. [2025-02-08 13:36:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:36:24,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:36:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:24,993 INFO L225 Difference]: With dead ends: 790 [2025-02-08 13:36:24,993 INFO L226 Difference]: Without dead ends: 789 [2025-02-08 13:36:24,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:24,995 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 539 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:24,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1106 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-08 13:36:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 412. [2025-02-08 13:36:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 400 states have (on average 1.4375) internal successors, (575), 404 states have internal predecessors, (575), 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-02-08 13:36:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 587 transitions. [2025-02-08 13:36:25,020 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 587 transitions. Word has length 6 [2025-02-08 13:36:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:25,020 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 587 transitions. [2025-02-08 13:36:25,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 587 transitions. [2025-02-08 13:36:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 13:36:25,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:25,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:25,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:36:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:25,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1893313922, now seen corresponding path program 1 times [2025-02-08 13:36:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288811928] [2025-02-08 13:36:25,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:25,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 13:36:25,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 13:36:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:36:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:25,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288811928] [2025-02-08 13:36:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288811928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:25,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:36:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769529115] [2025-02-08 13:36:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:25,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:25,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:25,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:36:25,901 INFO L87 Difference]: Start difference. First operand 412 states and 587 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:26,078 INFO L93 Difference]: Finished difference Result 821 states and 1171 transitions. [2025-02-08 13:36:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-08 13:36:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:26,080 INFO L225 Difference]: With dead ends: 821 [2025-02-08 13:36:26,080 INFO L226 Difference]: Without dead ends: 415 [2025-02-08 13:36:26,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:36:26,086 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 105 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:26,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1449 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-08 13:36:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2025-02-08 13:36:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 400 states have (on average 1.42) internal successors, (568), 404 states have internal predecessors, (568), 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-02-08 13:36:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 580 transitions. [2025-02-08 13:36:26,103 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 580 transitions. Word has length 148 [2025-02-08 13:36:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:26,103 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 580 transitions. [2025-02-08 13:36:26,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 580 transitions. [2025-02-08 13:36:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 13:36:26,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:26,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:26,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:36:26,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:26,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 923539832, now seen corresponding path program 1 times [2025-02-08 13:36:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081207762] [2025-02-08 13:36:26,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:26,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 13:36:26,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 13:36:26,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:26,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:36:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081207762] [2025-02-08 13:36:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081207762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:26,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:36:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833104568] [2025-02-08 13:36:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:26,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:36:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:26,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:36:26,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:26,414 INFO L87 Difference]: Start difference. First operand 412 states and 580 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:26,546 INFO L93 Difference]: Finished difference Result 944 states and 1340 transitions. [2025-02-08 13:36:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:36:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-08 13:36:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:26,550 INFO L225 Difference]: With dead ends: 944 [2025-02-08 13:36:26,550 INFO L226 Difference]: Without dead ends: 538 [2025-02-08 13:36:26,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:26,554 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 134 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:26,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1053 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-08 13:36:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-02-08 13:36:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 526 states have (on average 1.4315589353612168) internal successors, (753), 530 states have internal predecessors, (753), 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-02-08 13:36:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 765 transitions. [2025-02-08 13:36:26,575 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 765 transitions. Word has length 148 [2025-02-08 13:36:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:26,576 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 765 transitions. [2025-02-08 13:36:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:36:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 765 transitions. [2025-02-08 13:36:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 13:36:26,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:26,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:26,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:36:26,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:26,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1211688412, now seen corresponding path program 1 times [2025-02-08 13:36:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276661669] [2025-02-08 13:36:26,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:26,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 13:36:26,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 13:36:26,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:26,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:36:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276661669] [2025-02-08 13:36:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276661669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:36:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266546052] [2025-02-08 13:36:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:26,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:26,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:26,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:26,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:36:26,971 INFO L87 Difference]: Start difference. First operand 538 states and 765 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-02-08 13:36:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:27,134 INFO L93 Difference]: Finished difference Result 947 states and 1342 transitions. [2025-02-08 13:36:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:27,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 163 [2025-02-08 13:36:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:27,137 INFO L225 Difference]: With dead ends: 947 [2025-02-08 13:36:27,137 INFO L226 Difference]: Without dead ends: 541 [2025-02-08 13:36:27,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:36:27,140 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 105 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:27,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1428 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-08 13:36:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2025-02-08 13:36:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 526 states have (on average 1.4182509505703422) internal successors, (746), 530 states have internal predecessors, (746), 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-02-08 13:36:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 758 transitions. [2025-02-08 13:36:27,163 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 758 transitions. Word has length 163 [2025-02-08 13:36:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 758 transitions. [2025-02-08 13:36:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-02-08 13:36:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 758 transitions. [2025-02-08 13:36:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 13:36:27,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:27,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:36:27,167 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-02-08 13:36:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -275167274, now seen corresponding path program 1 times [2025-02-08 13:36:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891040020] [2025-02-08 13:36:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:27,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 13:36:27,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 13:36:27,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:27,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:36:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891040020] [2025-02-08 13:36:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891040020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:27,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:27,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:36:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165546297] [2025-02-08 13:36:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:27,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:36:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:27,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:36:27,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:27,449 INFO L87 Difference]: Start difference. First operand 538 states and 758 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-02-08 13:36:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:27,634 INFO L93 Difference]: Finished difference Result 1130 states and 1591 transitions. [2025-02-08 13:36:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:36:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 163 [2025-02-08 13:36:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:27,640 INFO L225 Difference]: With dead ends: 1130 [2025-02-08 13:36:27,640 INFO L226 Difference]: Without dead ends: 724 [2025-02-08 13:36:27,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:36:27,641 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 318 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:27,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1038 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:36:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-08 13:36:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-02-08 13:36:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 709 states have (on average 1.4174894217207334) internal successors, (1005), 713 states have internal predecessors, (1005), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:36:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1023 transitions. [2025-02-08 13:36:27,669 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1023 transitions. Word has length 163 [2025-02-08 13:36:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1023 transitions. [2025-02-08 13:36:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-02-08 13:36:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1023 transitions. [2025-02-08 13:36:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-08 13:36:27,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:27,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:27,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:36:27,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1025931220, now seen corresponding path program 1 times [2025-02-08 13:36:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675219655] [2025-02-08 13:36:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:27,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 13:36:27,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 13:36:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675219655] [2025-02-08 13:36:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675219655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:36:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754374585] [2025-02-08 13:36:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:36:28,029 INFO L87 Difference]: Start difference. First operand 724 states and 1023 transitions. Second operand has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:28,151 INFO L93 Difference]: Finished difference Result 724 states and 1023 transitions. [2025-02-08 13:36:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2025-02-08 13:36:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:28,155 INFO L225 Difference]: With dead ends: 724 [2025-02-08 13:36:28,155 INFO L226 Difference]: Without dead ends: 723 [2025-02-08 13:36:28,156 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-02-08 13:36:28,156 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 375 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:28,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1050 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-02-08 13:36:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-02-08 13:36:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 709 states have (on average 1.4160789844851904) internal successors, (1004), 712 states have internal predecessors, (1004), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:36:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1022 transitions. [2025-02-08 13:36:28,178 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1022 transitions. Word has length 178 [2025-02-08 13:36:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1022 transitions. [2025-02-08 13:36:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.666666666666664) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1022 transitions. [2025-02-08 13:36:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-08 13:36:28,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:28,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:28,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:36:28,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:28,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1739096894, now seen corresponding path program 1 times [2025-02-08 13:36:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:28,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454606787] [2025-02-08 13:36:28,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:28,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 13:36:28,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 13:36:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454606787] [2025-02-08 13:36:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454606787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:36:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675482631] [2025-02-08 13:36:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:28,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:28,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:28,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:36:28,469 INFO L87 Difference]: Start difference. First operand 723 states and 1022 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:28,650 INFO L93 Difference]: Finished difference Result 787 states and 1106 transitions. [2025-02-08 13:36:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 179 [2025-02-08 13:36:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:28,653 INFO L225 Difference]: With dead ends: 787 [2025-02-08 13:36:28,654 INFO L226 Difference]: Without dead ends: 786 [2025-02-08 13:36:28,654 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-02-08 13:36:28,654 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 368 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:28,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1543 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:36:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-02-08 13:36:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2025-02-08 13:36:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 769 states have (on average 1.4057217165149545) internal successors, (1081), 772 states have internal predecessors, (1081), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1105 transitions. [2025-02-08 13:36:28,681 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1105 transitions. Word has length 179 [2025-02-08 13:36:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:28,682 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1105 transitions. [2025-02-08 13:36:28,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1105 transitions. [2025-02-08 13:36:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 13:36:28,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:28,684 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:36:28,684 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-02-08 13:36:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -754778543, now seen corresponding path program 1 times [2025-02-08 13:36:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043793604] [2025-02-08 13:36:28,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:28,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 13:36:28,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 13:36:28,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:28,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 13:36:29,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:29,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043793604] [2025-02-08 13:36:29,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043793604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:29,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:29,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:36:29,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522563775] [2025-02-08 13:36:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:29,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:29,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:29,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:36:29,030 INFO L87 Difference]: Start difference. First operand 786 states and 1105 transitions. Second operand has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:29,162 INFO L93 Difference]: Finished difference Result 800 states and 1119 transitions. [2025-02-08 13:36:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:36:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-02-08 13:36:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:29,166 INFO L225 Difference]: With dead ends: 800 [2025-02-08 13:36:29,166 INFO L226 Difference]: Without dead ends: 798 [2025-02-08 13:36:29,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:36:29,167 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 400 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:29,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1023 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-08 13:36:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 789. [2025-02-08 13:36:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 772 states have (on average 1.4041450777202074) internal successors, (1084), 775 states have internal predecessors, (1084), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1108 transitions. [2025-02-08 13:36:29,190 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1108 transitions. Word has length 182 [2025-02-08 13:36:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1108 transitions. [2025-02-08 13:36:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.0) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1108 transitions. [2025-02-08 13:36:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-08 13:36:29,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:29,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:29,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:36:29,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1141910504, now seen corresponding path program 1 times [2025-02-08 13:36:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054342835] [2025-02-08 13:36:29,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:29,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 13:36:29,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 13:36:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054342835] [2025-02-08 13:36:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054342835] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497402002] [2025-02-08 13:36:30,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:30,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:30,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:30,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:36:30,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 13:36:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 13:36:30,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:30,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:30,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:36:30,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:36:30,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 13:36:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:31,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497402002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-02-08 13:36:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962734881] [2025-02-08 13:36:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 13:36:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:31,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 13:36:31,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:36:31,447 INFO L87 Difference]: Start difference. First operand 789 states and 1108 transitions. Second operand has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:34,286 INFO L93 Difference]: Finished difference Result 1541 states and 2158 transitions. [2025-02-08 13:36:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:36:34,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-02-08 13:36:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:34,293 INFO L225 Difference]: With dead ends: 1541 [2025-02-08 13:36:34,293 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 13:36:34,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-02-08 13:36:34,295 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 1018 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:34,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3169 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 13:36:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 13:36:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 814. [2025-02-08 13:36:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 797 states have (on average 1.397741530740276) internal successors, (1114), 800 states have internal predecessors, (1114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1138 transitions. [2025-02-08 13:36:34,324 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1138 transitions. Word has length 184 [2025-02-08 13:36:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:34,324 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1138 transitions. [2025-02-08 13:36:34,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1138 transitions. [2025-02-08 13:36:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 13:36:34,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:34,327 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:34,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:36:34,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:34,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1238486762, now seen corresponding path program 1 times [2025-02-08 13:36:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301113673] [2025-02-08 13:36:34,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:34,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:36:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:36:35,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301113673] [2025-02-08 13:36:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301113673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946528063] [2025-02-08 13:36:35,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:35,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:35,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:36:36,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:36:36,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:36:36,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:36,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:36,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 13:36:36,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:36,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946528063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:36:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107585252] [2025-02-08 13:36:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:36,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:36,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:36:36,371 INFO L87 Difference]: Start difference. First operand 814 states and 1138 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:36,666 INFO L93 Difference]: Finished difference Result 1561 states and 2185 transitions. [2025-02-08 13:36:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-02-08 13:36:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:36,670 INFO L225 Difference]: With dead ends: 1561 [2025-02-08 13:36:36,670 INFO L226 Difference]: Without dead ends: 857 [2025-02-08 13:36:36,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:36:36,672 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 17 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:36,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1379 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:36:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-08 13:36:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 841. [2025-02-08 13:36:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 824 states have (on average 1.391990291262136) internal successors, (1147), 827 states have internal predecessors, (1147), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1171 transitions. [2025-02-08 13:36:36,701 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1171 transitions. Word has length 185 [2025-02-08 13:36:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1171 transitions. [2025-02-08 13:36:36,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1171 transitions. [2025-02-08 13:36:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 13:36:36,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:36,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:36,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:36:36,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:36,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:36,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1233659989, now seen corresponding path program 1 times [2025-02-08 13:36:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849405626] [2025-02-08 13:36:36,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:36,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:36:37,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:36:37,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849405626] [2025-02-08 13:36:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849405626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:36:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679650277] [2025-02-08 13:36:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:36:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:37,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:36:37,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:36:37,375 INFO L87 Difference]: Start difference. First operand 841 states and 1171 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:37,966 INFO L93 Difference]: Finished difference Result 1580 states and 2204 transitions. [2025-02-08 13:36:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:36:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-02-08 13:36:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:37,970 INFO L225 Difference]: With dead ends: 1580 [2025-02-08 13:36:37,970 INFO L226 Difference]: Without dead ends: 853 [2025-02-08 13:36:37,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:36:37,971 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 8 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:37,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2098 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:36:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-02-08 13:36:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2025-02-08 13:36:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 832 states have (on average 1.390625) internal successors, (1157), 835 states have internal predecessors, (1157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1181 transitions. [2025-02-08 13:36:37,997 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1181 transitions. Word has length 186 [2025-02-08 13:36:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:37,997 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1181 transitions. [2025-02-08 13:36:37,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1181 transitions. [2025-02-08 13:36:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-08 13:36:38,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:38,000 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:38,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:36:38,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:38,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:38,002 INFO L85 PathProgramCache]: Analyzing trace with hash -369538098, now seen corresponding path program 1 times [2025-02-08 13:36:38,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:38,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88290863] [2025-02-08 13:36:38,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 13:36:38,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 13:36:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:38,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88290863] [2025-02-08 13:36:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88290863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:38,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:36:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316959293] [2025-02-08 13:36:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:36:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:38,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:36:38,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:36:38,417 INFO L87 Difference]: Start difference. First operand 849 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:39,097 INFO L93 Difference]: Finished difference Result 1595 states and 2224 transitions. [2025-02-08 13:36:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:36:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-02-08 13:36:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:39,101 INFO L225 Difference]: With dead ends: 1595 [2025-02-08 13:36:39,101 INFO L226 Difference]: Without dead ends: 871 [2025-02-08 13:36:39,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:36:39,103 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 12 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:39,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2489 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:36:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-02-08 13:36:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2025-02-08 13:36:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 848 states have (on average 1.3903301886792452) internal successors, (1179), 851 states have internal predecessors, (1179), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1203 transitions. [2025-02-08 13:36:39,130 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1203 transitions. Word has length 187 [2025-02-08 13:36:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1203 transitions. [2025-02-08 13:36:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1203 transitions. [2025-02-08 13:36:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-08 13:36:39,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:39,135 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:36:39,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1067097466, now seen corresponding path program 1 times [2025-02-08 13:36:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302084130] [2025-02-08 13:36:39,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:39,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 13:36:39,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 13:36:39,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:39,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302084130] [2025-02-08 13:36:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302084130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:39,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701158465] [2025-02-08 13:36:39,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:39,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:39,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:36:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 13:36:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 13:36:40,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:40,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:40,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 13:36:40,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:40,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701158465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 13:36:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633016636] [2025-02-08 13:36:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:36:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:40,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:36:40,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:40,790 INFO L87 Difference]: Start difference. First operand 865 states and 1203 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:41,530 INFO L93 Difference]: Finished difference Result 1611 states and 2245 transitions. [2025-02-08 13:36:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:36:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-02-08 13:36:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:41,534 INFO L225 Difference]: With dead ends: 1611 [2025-02-08 13:36:41,535 INFO L226 Difference]: Without dead ends: 879 [2025-02-08 13:36:41,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:41,536 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 12 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:41,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2495 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 13:36:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-08 13:36:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 865. [2025-02-08 13:36:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 848 states have (on average 1.3903301886792452) internal successors, (1179), 851 states have internal predecessors, (1179), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1203 transitions. [2025-02-08 13:36:41,564 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1203 transitions. Word has length 187 [2025-02-08 13:36:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:41,564 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1203 transitions. [2025-02-08 13:36:41,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1203 transitions. [2025-02-08 13:36:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-08 13:36:41,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:41,566 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:41,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:36:41,767 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,SelfDestructingSolverStorable13 [2025-02-08 13:36:41,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1850904046, now seen corresponding path program 1 times [2025-02-08 13:36:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:41,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813355125] [2025-02-08 13:36:41,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:41,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 13:36:41,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 13:36:41,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:41,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813355125] [2025-02-08 13:36:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813355125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:36:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390847839] [2025-02-08 13:36:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:42,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:36:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:42,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:36:42,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:42,326 INFO L87 Difference]: Start difference. First operand 865 states and 1203 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:42,979 INFO L93 Difference]: Finished difference Result 1618 states and 2251 transitions. [2025-02-08 13:36:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:36:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-02-08 13:36:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:42,983 INFO L225 Difference]: With dead ends: 1618 [2025-02-08 13:36:42,984 INFO L226 Difference]: Without dead ends: 891 [2025-02-08 13:36:42,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:42,986 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 20 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:42,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2995 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:36:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-02-08 13:36:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 879. [2025-02-08 13:36:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 862 states have (on average 1.388631090487239) internal successors, (1197), 865 states have internal predecessors, (1197), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1221 transitions. [2025-02-08 13:36:43,013 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1221 transitions. Word has length 188 [2025-02-08 13:36:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1221 transitions. [2025-02-08 13:36:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1221 transitions. [2025-02-08 13:36:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-08 13:36:43,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:43,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:43,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:36:43,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:43,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2000407974, now seen corresponding path program 1 times [2025-02-08 13:36:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712586353] [2025-02-08 13:36:43,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:43,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 13:36:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 13:36:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712586353] [2025-02-08 13:36:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712586353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692590491] [2025-02-08 13:36:43,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:43,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:43,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:36:44,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 13:36:44,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 13:36:44,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:44,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:44,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 13:36:44,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:44,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:44,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692590491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:44,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:44,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 13:36:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924692772] [2025-02-08 13:36:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:36:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:36:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:44,433 INFO L87 Difference]: Start difference. First operand 879 states and 1221 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:45,029 INFO L93 Difference]: Finished difference Result 1641 states and 2284 transitions. [2025-02-08 13:36:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:36:45,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-02-08 13:36:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:45,033 INFO L225 Difference]: With dead ends: 1641 [2025-02-08 13:36:45,033 INFO L226 Difference]: Without dead ends: 907 [2025-02-08 13:36:45,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 13:36:45,035 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 40 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:45,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2567 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:36:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-02-08 13:36:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 893. [2025-02-08 13:36:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 876 states have (on average 1.389269406392694) internal successors, (1217), 879 states have internal predecessors, (1217), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1241 transitions. [2025-02-08 13:36:45,059 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1241 transitions. Word has length 188 [2025-02-08 13:36:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1241 transitions. [2025-02-08 13:36:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1241 transitions. [2025-02-08 13:36:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 13:36:45,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:45,062 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:45,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:36:45,266 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,SelfDestructingSolverStorable15 [2025-02-08 13:36:45,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 76611605, now seen corresponding path program 1 times [2025-02-08 13:36:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144167519] [2025-02-08 13:36:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:36:45,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:36:45,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:45,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144167519] [2025-02-08 13:36:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144167519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:36:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 13:36:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382124952] [2025-02-08 13:36:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:36:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:36:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:36:45,797 INFO L87 Difference]: Start difference. First operand 893 states and 1241 transitions. Second operand has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:46,516 INFO L93 Difference]: Finished difference Result 1657 states and 2306 transitions. [2025-02-08 13:36:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:36:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-02-08 13:36:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:46,520 INFO L225 Difference]: With dead ends: 1657 [2025-02-08 13:36:46,521 INFO L226 Difference]: Without dead ends: 911 [2025-02-08 13:36:46,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:36:46,523 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 26 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:46,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2975 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 13:36:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-02-08 13:36:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 899. [2025-02-08 13:36:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 882 states have (on average 1.3866213151927438) internal successors, (1223), 885 states have internal predecessors, (1223), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1247 transitions. [2025-02-08 13:36:46,548 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1247 transitions. Word has length 189 [2025-02-08 13:36:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:46,549 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1247 transitions. [2025-02-08 13:36:46,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1247 transitions. [2025-02-08 13:36:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 13:36:46,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:46,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:36:46,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1377637271, now seen corresponding path program 1 times [2025-02-08 13:36:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113993718] [2025-02-08 13:36:46,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:36:46,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:36:46,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:46,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113993718] [2025-02-08 13:36:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113993718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218314131] [2025-02-08 13:36:47,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:47,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:47,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:47,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:36:47,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:36:47,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:36:47,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:47,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:47,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 13:36:47,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:36:48,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218314131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 13:36:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078250016] [2025-02-08 13:36:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:36:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:48,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:36:48,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:48,126 INFO L87 Difference]: Start difference. First operand 899 states and 1247 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:48,786 INFO L93 Difference]: Finished difference Result 1658 states and 2305 transitions. [2025-02-08 13:36:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:36:48,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-02-08 13:36:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:48,790 INFO L225 Difference]: With dead ends: 1658 [2025-02-08 13:36:48,790 INFO L226 Difference]: Without dead ends: 909 [2025-02-08 13:36:48,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:36:48,791 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 10 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:48,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2495 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:36:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-02-08 13:36:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 899. [2025-02-08 13:36:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 882 states have (on average 1.3866213151927438) internal successors, (1223), 885 states have internal predecessors, (1223), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:36:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1247 transitions. [2025-02-08 13:36:48,821 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1247 transitions. Word has length 189 [2025-02-08 13:36:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:48,821 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1247 transitions. [2025-02-08 13:36:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:36:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1247 transitions. [2025-02-08 13:36:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 13:36:48,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:48,824 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:48,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:36:49,024 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,SelfDestructingSolverStorable17 [2025-02-08 13:36:49,025 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash -263042867, now seen corresponding path program 1 times [2025-02-08 13:36:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998476684] [2025-02-08 13:36:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:49,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:36:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:36:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:36:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998476684] [2025-02-08 13:36:49,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998476684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3249033] [2025-02-08 13:36:49,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:49,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:36:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 13:36:50,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 13:36:50,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:50,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:50,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 13:36:50,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:36:50,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:36:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3249033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:36:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:36:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:36:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220378023] [2025-02-08 13:36:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:36:50,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:36:50,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:36:50,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:36:50,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:36:50,501 INFO L87 Difference]: Start difference. First operand 899 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:36:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:36:50,643 INFO L93 Difference]: Finished difference Result 1611 states and 2245 transitions. [2025-02-08 13:36:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:36:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-02-08 13:36:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:36:50,649 INFO L225 Difference]: With dead ends: 1611 [2025-02-08 13:36:50,649 INFO L226 Difference]: Without dead ends: 902 [2025-02-08 13:36:50,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:36:50,652 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:36:50,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1550 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:36:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-02-08 13:36:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2025-02-08 13:36:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 884 states have (on average 1.3868778280542986) internal successors, (1226), 888 states have internal predecessors, (1226), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:36:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1254 transitions. [2025-02-08 13:36:50,680 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1254 transitions. Word has length 189 [2025-02-08 13:36:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:36:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1254 transitions. [2025-02-08 13:36:50,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:36:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1254 transitions. [2025-02-08 13:36:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-08 13:36:50,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:36:50,683 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:36:50,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:36:50,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:50,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:36:50,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:36:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2010167501, now seen corresponding path program 1 times [2025-02-08 13:36:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:36:50,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946146452] [2025-02-08 13:36:50,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:36:50,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 13:36:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 13:36:51,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:36:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:36:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946146452] [2025-02-08 13:36:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946146452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:36:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059151007] [2025-02-08 13:36:51,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:36:51,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:36:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:36:51,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:36:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:36:52,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 13:36:52,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 13:36:52,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:36:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:36:52,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-02-08 13:36:52,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:36:52,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:36:52,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:36:53,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2025-02-08 13:36:53,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2025-02-08 13:36:53,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 13:36:53,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 13:36:53,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:36:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 13:36:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 13:36:53,311 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 13:36:53,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 13:36:53,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 13:36:53,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 13:36:53,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 13:36:53,556 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:36:53,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-02-08 13:36:53,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-02-08 13:36:53,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11