./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:23:01,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:23:01,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:23:01,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:23:01,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:23:01,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:23:01,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:23:01,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:23:01,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:23:01,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:23:01,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:23:01,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:23:01,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:23:01,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:23:01,657 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:23:01,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:23:01,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:23:01,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:23:01,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:23:01,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:23:01,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:23:01,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:23:01,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:23:01,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:23:01,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:23:01,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:23:01,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:23:01,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:23:01,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:23:01,661 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2025-01-10 06:23:01,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:23:01,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:23:01,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:23:01,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:23:01,936 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:23:01,937 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_OAT_test4-3.i [2025-01-10 06:23:03,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2a06db72/20b2b4f9f33b450a940654f45a40ad60/FLAG6cac67a4e [2025-01-10 06:23:03,593 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:23:03,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2025-01-10 06:23:03,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2a06db72/20b2b4f9f33b450a940654f45a40ad60/FLAG6cac67a4e [2025-01-10 06:23:03,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2a06db72/20b2b4f9f33b450a940654f45a40ad60 [2025-01-10 06:23:03,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:23:03,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:23:03,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:23:03,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:23:03,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:23:03,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:23:03" (1/1) ... [2025-01-10 06:23:03,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efc6051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:03, skipping insertion in model container [2025-01-10 06:23:03,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:23:03" (1/1) ... [2025-01-10 06:23:03,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:23:04,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:23:04,186 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:23:04,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:23:04,339 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:23:04,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04 WrapperNode [2025-01-10 06:23:04,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:23:04,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:23:04,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:23:04,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:23:04,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,436 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-01-10 06:23:04,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:23:04,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:23:04,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:23:04,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:23:04,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,626 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-01-10 06:23:04,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:23:04,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:23:04,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:23:04,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:23:04,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (1/1) ... [2025-01-10 06:23:04,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:23:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:04,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:23:04,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:23:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:23:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:23:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:23:04,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:23:04,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:23:04,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:23:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:23:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:23:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:23:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:23:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:23:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:23:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:23:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:23:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:23:04,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:23:05,041 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:23:05,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:23:06,733 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-01-10 06:23:06,734 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:23:06,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:23:06,761 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-10 06:23:06,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:23:06 BoogieIcfgContainer [2025-01-10 06:23:06,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:23:06,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:23:06,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:23:06,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:23:06,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:23:03" (1/3) ... [2025-01-10 06:23:06,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e63f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:23:06, skipping insertion in model container [2025-01-10 06:23:06,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:23:04" (2/3) ... [2025-01-10 06:23:06,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e63f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:23:06, skipping insertion in model container [2025-01-10 06:23:06,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:23:06" (3/3) ... [2025-01-10 06:23:06,770 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2025-01-10 06:23:06,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:23:06,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-3.i that has 4 procedures, 496 locations, 1 initial locations, 45 loop locations, and 6 error locations. [2025-01-10 06:23:06,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:23:06,869 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;@47a8a238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:23:06,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:23:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 492 states, 467 states have (on average 1.6188436830835118) internal successors, (756), 483 states have internal predecessors, (756), 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-01-10 06:23:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:23:06,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:06,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:23:06,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 45424403, now seen corresponding path program 1 times [2025-01-10 06:23:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797915723] [2025-01-10 06:23:06,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:06,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:23:06,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:23:06,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:06,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:23:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797915723] [2025-01-10 06:23:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797915723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:23:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471537387] [2025-01-10 06:23:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:07,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:23:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:07,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:23:07,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:23:07,089 INFO L87 Difference]: Start difference. First operand has 492 states, 467 states have (on average 1.6188436830835118) internal successors, (756), 483 states have internal predecessors, (756), 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:07,240 INFO L93 Difference]: Finished difference Result 1364 states and 2205 transitions. [2025-01-10 06:23:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:23:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 06:23:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:07,258 INFO L225 Difference]: With dead ends: 1364 [2025-01-10 06:23:07,259 INFO L226 Difference]: Without dead ends: 810 [2025-01-10 06:23:07,265 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-01-10 06:23:07,268 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 545 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:07,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1485 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:23:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-10 06:23:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 431. [2025-01-10 06:23:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4534313725490196) internal successors, (593), 422 states have internal predecessors, (593), 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-01-10 06:23:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2025-01-10 06:23:07,346 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 5 [2025-01-10 06:23:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2025-01-10 06:23:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2025-01-10 06:23:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:23:07,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:07,356 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, 1] [2025-01-10 06:23:07,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:23:07,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:07,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 191633172, now seen corresponding path program 1 times [2025-01-10 06:23:07,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:07,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254114330] [2025-01-10 06:23:07,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:07,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:23:07,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:23:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:23:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254114330] [2025-01-10 06:23:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254114330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:23:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55872758] [2025-01-10 06:23:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:08,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:23:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:08,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:23:08,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:23:08,128 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:08,252 INFO L93 Difference]: Finished difference Result 858 states and 1246 transitions. [2025-01-10 06:23:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:23:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2025-01-10 06:23:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:08,258 INFO L225 Difference]: With dead ends: 858 [2025-01-10 06:23:08,260 INFO L226 Difference]: Without dead ends: 434 [2025-01-10 06:23:08,261 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-01-10 06:23:08,261 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 105 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:08,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1686 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:23:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-10 06:23:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2025-01-10 06:23:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4362745098039216) internal successors, (586), 422 states have internal predecessors, (586), 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-01-10 06:23:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 618 transitions. [2025-01-10 06:23:08,290 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 618 transitions. Word has length 149 [2025-01-10 06:23:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:08,290 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 618 transitions. [2025-01-10 06:23:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 618 transitions. [2025-01-10 06:23:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:23:08,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:08,296 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, 1] [2025-01-10 06:23:08,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:23:08,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1530373384, now seen corresponding path program 1 times [2025-01-10 06:23:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160766622] [2025-01-10 06:23:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:08,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:23:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:23:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:23:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160766622] [2025-01-10 06:23:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160766622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:23:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499513535] [2025-01-10 06:23:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:23:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:08,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:23:08,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:23:08,621 INFO L87 Difference]: Start difference. First operand 431 states and 618 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:08,703 INFO L93 Difference]: Finished difference Result 981 states and 1415 transitions. [2025-01-10 06:23:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:23:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-01-10 06:23:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:08,709 INFO L225 Difference]: With dead ends: 981 [2025-01-10 06:23:08,711 INFO L226 Difference]: Without dead ends: 557 [2025-01-10 06:23:08,712 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-01-10 06:23:08,715 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 134 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:08,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:23:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-10 06:23:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-10 06:23:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 534 states have (on average 1.4438202247191012) internal successors, (771), 548 states have internal predecessors, (771), 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-01-10 06:23:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 803 transitions. [2025-01-10 06:23:08,742 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 803 transitions. Word has length 149 [2025-01-10 06:23:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 803 transitions. [2025-01-10 06:23:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:23:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 803 transitions. [2025-01-10 06:23:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:23:08,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:08,748 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, 1] [2025-01-10 06:23:08,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:23:08,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:08,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1371822598, now seen corresponding path program 1 times [2025-01-10 06:23:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838173813] [2025-01-10 06:23:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:23:08,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:23:08,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:08,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:23:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838173813] [2025-01-10 06:23:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838173813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:09,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:09,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:23:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468912327] [2025-01-10 06:23:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:09,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:23:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:09,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:23:09,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:23:09,189 INFO L87 Difference]: Start difference. First operand 557 states and 803 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:23:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:09,290 INFO L93 Difference]: Finished difference Result 939 states and 1348 transitions. [2025-01-10 06:23:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:23:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-01-10 06:23:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:09,295 INFO L225 Difference]: With dead ends: 939 [2025-01-10 06:23:09,297 INFO L226 Difference]: Without dead ends: 515 [2025-01-10 06:23:09,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:23:09,299 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 30 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:09,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1517 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:23:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-10 06:23:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-01-10 06:23:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.410569105691057) internal successors, (694), 506 states have internal predecessors, (694), 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-01-10 06:23:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 726 transitions. [2025-01-10 06:23:09,319 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 726 transitions. Word has length 164 [2025-01-10 06:23:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:09,320 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 726 transitions. [2025-01-10 06:23:09,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:23:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 726 transitions. [2025-01-10 06:23:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:23:09,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:09,323 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, 1] [2025-01-10 06:23:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:23:09,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -282471826, now seen corresponding path program 1 times [2025-01-10 06:23:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583388307] [2025-01-10 06:23:09,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:23:09,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:23:09,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:09,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:23:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583388307] [2025-01-10 06:23:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583388307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:23:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656588741] [2025-01-10 06:23:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:09,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:23:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:09,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:23:09,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:23:09,647 INFO L87 Difference]: Start difference. First operand 515 states and 726 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:23:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:09,713 INFO L93 Difference]: Finished difference Result 1042 states and 1457 transitions. [2025-01-10 06:23:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:23:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-01-10 06:23:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:09,723 INFO L225 Difference]: With dead ends: 1042 [2025-01-10 06:23:09,723 INFO L226 Difference]: Without dead ends: 660 [2025-01-10 06:23:09,724 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-01-10 06:23:09,725 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 243 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:09,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1050 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:23:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-10 06:23:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-10 06:23:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 634 states have (on average 1.3943217665615142) internal successors, (884), 648 states have internal predecessors, (884), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 06:23:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 922 transitions. [2025-01-10 06:23:09,763 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 922 transitions. Word has length 164 [2025-01-10 06:23:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 922 transitions. [2025-01-10 06:23:09,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:23:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 922 transitions. [2025-01-10 06:23:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-10 06:23:09,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:09,768 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-01-10 06:23:09,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:23:09,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:09,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1774081106, now seen corresponding path program 1 times [2025-01-10 06:23:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133399224] [2025-01-10 06:23:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:09,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-10 06:23:09,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-10 06:23:09,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:09,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133399224] [2025-01-10 06:23:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133399224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:23:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830794075] [2025-01-10 06:23:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:23:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:23:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:23:10,232 INFO L87 Difference]: Start difference. First operand 660 states and 922 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-01-10 06:23:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:10,293 INFO L93 Difference]: Finished difference Result 726 states and 1008 transitions. [2025-01-10 06:23:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:23:10,294 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-01-10 06:23:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:10,300 INFO L225 Difference]: With dead ends: 726 [2025-01-10 06:23:10,301 INFO L226 Difference]: Without dead ends: 724 [2025-01-10 06:23:10,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:23:10,303 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 295 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:10,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1649 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:23:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-10 06:23:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-01-10 06:23:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 695 states have (on average 1.3841726618705037) internal successors, (962), 709 states have internal predecessors, (962), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 06:23:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1006 transitions. [2025-01-10 06:23:10,331 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1006 transitions. Word has length 179 [2025-01-10 06:23:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:10,332 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1006 transitions. [2025-01-10 06:23:10,332 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-01-10 06:23:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1006 transitions. [2025-01-10 06:23:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-10 06:23:10,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:10,336 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, 1] [2025-01-10 06:23:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:23:10,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 64135474, now seen corresponding path program 1 times [2025-01-10 06:23:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254997521] [2025-01-10 06:23:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:10,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:23:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:23:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254997521] [2025-01-10 06:23:10,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254997521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119976207] [2025-01-10 06:23:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:10,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:10,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:23:11,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:23:11,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:23:11,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:11,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:11,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:23:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:11,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:23:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119976207] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:23:11,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:23:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:23:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801546424] [2025-01-10 06:23:11,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:23:11,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:23:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:11,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:23:11,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:23:11,915 INFO L87 Difference]: Start difference. First operand 724 states and 1006 transitions. Second operand has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:23:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:12,090 INFO L93 Difference]: Finished difference Result 1101 states and 1538 transitions. [2025-01-10 06:23:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:23:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-01-10 06:23:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:12,096 INFO L225 Difference]: With dead ends: 1101 [2025-01-10 06:23:12,096 INFO L226 Difference]: Without dead ends: 1069 [2025-01-10 06:23:12,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:23:12,097 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1762 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:12,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 2701 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:23:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-10 06:23:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-01-10 06:23:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1034 states have (on average 1.3820116054158607) internal successors, (1429), 1048 states have internal predecessors, (1429), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1485 transitions. [2025-01-10 06:23:12,133 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1485 transitions. Word has length 183 [2025-01-10 06:23:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1485 transitions. [2025-01-10 06:23:12,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:23:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1485 transitions. [2025-01-10 06:23:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-10 06:23:12,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:12,136 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-01-10 06:23:12,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:23:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:12,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 100945493, now seen corresponding path program 1 times [2025-01-10 06:23:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:12,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155985988] [2025-01-10 06:23:12,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:12,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:23:13,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:23:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155985988] [2025-01-10 06:23:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155985988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636132345] [2025-01-10 06:23:13,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:13,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:13,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:23:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:23:14,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:23:14,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:14,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:23:14,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:14,224 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-01-10 06:23:14,255 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-01-10 06:23:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:15,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636132345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-10 06:23:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751815117] [2025-01-10 06:23:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:15,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:23:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:15,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:23:15,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:23:15,093 INFO L87 Difference]: Start difference. First operand 1069 states and 1485 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 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-01-10 06:23:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:18,194 INFO L93 Difference]: Finished difference Result 2100 states and 2911 transitions. [2025-01-10 06:23:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:23:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 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-01-10 06:23:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:18,204 INFO L225 Difference]: With dead ends: 2100 [2025-01-10 06:23:18,205 INFO L226 Difference]: Without dead ends: 1117 [2025-01-10 06:23:18,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 06:23:18,208 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 940 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:18,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 3960 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 06:23:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-10 06:23:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1094. [2025-01-10 06:23:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1059 states have (on average 1.3777148253068934) internal successors, (1459), 1073 states have internal predecessors, (1459), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1515 transitions. [2025-01-10 06:23:18,262 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1515 transitions. Word has length 185 [2025-01-10 06:23:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:18,262 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1515 transitions. [2025-01-10 06:23:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 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-01-10 06:23:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1515 transitions. [2025-01-10 06:23:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 06:23:18,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:18,265 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-01-10 06:23:18,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:23:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:18,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:18,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 459924266, now seen corresponding path program 1 times [2025-01-10 06:23:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:18,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313880458] [2025-01-10 06:23:18,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:18,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:23:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:23:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:19,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313880458] [2025-01-10 06:23:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313880458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17934254] [2025-01-10 06:23:19,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:19,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:19,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:19,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:19,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:23:19,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:23:19,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:23:19,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:19,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:23:19,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:20,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17934254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:23:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991909007] [2025-01-10 06:23:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:20,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:23:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:20,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:23:20,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:23:20,051 INFO L87 Difference]: Start difference. First operand 1094 states and 1515 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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-01-10 06:23:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:20,318 INFO L93 Difference]: Finished difference Result 2154 states and 2983 transitions. [2025-01-10 06:23:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:23:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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-01-10 06:23:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:20,326 INFO L225 Difference]: With dead ends: 2154 [2025-01-10 06:23:20,327 INFO L226 Difference]: Without dead ends: 1171 [2025-01-10 06:23:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 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-01-10 06:23:20,330 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 17 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:20,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1373 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:23:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-01-10 06:23:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1147. [2025-01-10 06:23:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1112 states have (on average 1.370503597122302) internal successors, (1524), 1126 states have internal predecessors, (1524), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1580 transitions. [2025-01-10 06:23:20,383 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1580 transitions. Word has length 186 [2025-01-10 06:23:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:20,383 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1580 transitions. [2025-01-10 06:23:20,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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-01-10 06:23:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1580 transitions. [2025-01-10 06:23:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:23:20,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:20,387 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-01-10 06:23:20,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:23:20,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:20,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1975150790, now seen corresponding path program 1 times [2025-01-10 06:23:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:20,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852658682] [2025-01-10 06:23:20,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:20,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:23:20,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:23:20,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:20,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852658682] [2025-01-10 06:23:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852658682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:21,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:23:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263665979] [2025-01-10 06:23:21,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:21,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:23:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:21,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:23:21,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:23:21,122 INFO L87 Difference]: Start difference. First operand 1147 states and 1580 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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-01-10 06:23:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:21,557 INFO L93 Difference]: Finished difference Result 2197 states and 3030 transitions. [2025-01-10 06:23:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:23:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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-01-10 06:23:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:21,564 INFO L225 Difference]: With dead ends: 2197 [2025-01-10 06:23:21,565 INFO L226 Difference]: Without dead ends: 1165 [2025-01-10 06:23:21,567 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-01-10 06:23:21,568 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 8 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:21,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1701 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:23:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-01-10 06:23:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1159. [2025-01-10 06:23:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1124 states have (on average 1.3692170818505338) internal successors, (1539), 1138 states have internal predecessors, (1539), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1595 transitions. [2025-01-10 06:23:21,610 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1595 transitions. Word has length 187 [2025-01-10 06:23:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:21,610 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1595 transitions. [2025-01-10 06:23:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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-01-10 06:23:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1595 transitions. [2025-01-10 06:23:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:23:21,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:21,612 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-01-10 06:23:21,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:23:21,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1921694127, now seen corresponding path program 1 times [2025-01-10 06:23:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808724256] [2025-01-10 06:23:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:21,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:23:21,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:23:21,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:21,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:22,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:22,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808724256] [2025-01-10 06:23:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808724256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:23:22,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513130454] [2025-01-10 06:23:22,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:22,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:23:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:22,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:23:22,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:23:22,061 INFO L87 Difference]: Start difference. First operand 1159 states and 1595 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-01-10 06:23:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:22,612 INFO L93 Difference]: Finished difference Result 2225 states and 3068 transitions. [2025-01-10 06:23:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:23:22,612 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-01-10 06:23:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:22,618 INFO L225 Difference]: With dead ends: 2225 [2025-01-10 06:23:22,618 INFO L226 Difference]: Without dead ends: 1192 [2025-01-10 06:23:22,620 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-01-10 06:23:22,621 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:22,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2438 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:23:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-01-10 06:23:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1183. [2025-01-10 06:23:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1148 states have (on average 1.3693379790940767) internal successors, (1572), 1162 states have internal predecessors, (1572), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1628 transitions. [2025-01-10 06:23:22,657 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1628 transitions. Word has length 188 [2025-01-10 06:23:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:22,657 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1628 transitions. [2025-01-10 06:23:22,658 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-01-10 06:23:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1628 transitions. [2025-01-10 06:23:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:23:22,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:22,660 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-01-10 06:23:22,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:23:22,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:22,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2016805101, now seen corresponding path program 1 times [2025-01-10 06:23:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121866046] [2025-01-10 06:23:22,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:23:23,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:23:23,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:23,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:23,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121866046] [2025-01-10 06:23:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121866046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469174783] [2025-01-10 06:23:23,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:23,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:23,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:23:23,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:23:24,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:23:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:24,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:23:24,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:23:24,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469174783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:24,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-01-10 06:23:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112339969] [2025-01-10 06:23:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:24,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:23:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:24,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:23:24,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:23:24,613 INFO L87 Difference]: Start difference. First operand 1183 states and 1628 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:24,996 INFO L93 Difference]: Finished difference Result 2130 states and 2943 transitions. [2025-01-10 06:23:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:23:24,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-01-10 06:23:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:25,004 INFO L225 Difference]: With dead ends: 2130 [2025-01-10 06:23:25,004 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 06:23:25,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:23:25,007 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 25 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:25,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2760 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:23:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 06:23:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2025-01-10 06:23:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.3652694610778444) internal successors, (1596), 1183 states have internal predecessors, (1596), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1652 transitions. [2025-01-10 06:23:25,049 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1652 transitions. Word has length 188 [2025-01-10 06:23:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:25,049 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1652 transitions. [2025-01-10 06:23:25,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1652 transitions. [2025-01-10 06:23:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:23:25,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:25,052 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-01-10 06:23:25,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:23:25,253 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,SelfDestructingSolverStorable11 [2025-01-10 06:23:25,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:25,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2011255522, now seen corresponding path program 1 times [2025-01-10 06:23:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783370223] [2025-01-10 06:23:25,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:23:25,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:23:25,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:25,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:25,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:25,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783370223] [2025-01-10 06:23:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783370223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:23:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628333282] [2025-01-10 06:23:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:25,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:23:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:25,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:23:25,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:23:25,873 INFO L87 Difference]: Start difference. First operand 1204 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:26,273 INFO L93 Difference]: Finished difference Result 2143 states and 2941 transitions. [2025-01-10 06:23:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:23:26,274 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-01-10 06:23:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:26,279 INFO L225 Difference]: With dead ends: 2143 [2025-01-10 06:23:26,280 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 06:23:26,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:23:26,283 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 20 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:26,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2724 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:23:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 06:23:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1195. [2025-01-10 06:23:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1160 states have (on average 1.3629310344827585) internal successors, (1581), 1174 states have internal predecessors, (1581), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1637 transitions. [2025-01-10 06:23:26,316 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1637 transitions. Word has length 189 [2025-01-10 06:23:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:26,317 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1637 transitions. [2025-01-10 06:23:26,317 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1637 transitions. [2025-01-10 06:23:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:23:26,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:26,320 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, 1] [2025-01-10 06:23:26,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:23:26,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:26,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1223294168, now seen corresponding path program 1 times [2025-01-10 06:23:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:26,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224642683] [2025-01-10 06:23:26,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:26,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:23:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:23:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224642683] [2025-01-10 06:23:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224642683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:23:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680249947] [2025-01-10 06:23:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:23:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:26,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:23:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:23:26,845 INFO L87 Difference]: Start difference. First operand 1195 states and 1637 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:27,087 INFO L93 Difference]: Finished difference Result 2141 states and 2935 transitions. [2025-01-10 06:23:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:23:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2025-01-10 06:23:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:27,094 INFO L225 Difference]: With dead ends: 2141 [2025-01-10 06:23:27,094 INFO L226 Difference]: Without dead ends: 1222 [2025-01-10 06:23:27,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:23:27,096 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 16 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1900 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:23:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-10 06:23:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1204. [2025-01-10 06:23:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.360136869118905) internal successors, (1590), 1183 states have internal predecessors, (1590), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1646 transitions. [2025-01-10 06:23:27,126 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1646 transitions. Word has length 190 [2025-01-10 06:23:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1646 transitions. [2025-01-10 06:23:27,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:23:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1646 transitions. [2025-01-10 06:23:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:23:27,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:27,129 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, 1, 1] [2025-01-10 06:23:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:23:27,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash -764782677, now seen corresponding path program 1 times [2025-01-10 06:23:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430148205] [2025-01-10 06:23:27,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:27,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:27,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:23:27,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:23:27,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:27,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430148205] [2025-01-10 06:23:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430148205] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331392765] [2025-01-10 06:23:27,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:27,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:27,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:23:28,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:23:28,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:23:28,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:28,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:28,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:23:28,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:28,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331392765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:23:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702493340] [2025-01-10 06:23:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:23:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:23:28,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:23:28,603 INFO L87 Difference]: Start difference. First operand 1204 states and 1646 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 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-01-10 06:23:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:29,183 INFO L93 Difference]: Finished difference Result 2295 states and 3141 transitions. [2025-01-10 06:23:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:23:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 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 191 [2025-01-10 06:23:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:29,188 INFO L225 Difference]: With dead ends: 2295 [2025-01-10 06:23:29,188 INFO L226 Difference]: Without dead ends: 1225 [2025-01-10 06:23:29,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 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-01-10 06:23:29,190 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 12 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:29,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2439 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:23:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-01-10 06:23:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1204. [2025-01-10 06:23:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.360136869118905) internal successors, (1590), 1183 states have internal predecessors, (1590), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1646 transitions. [2025-01-10 06:23:29,217 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1646 transitions. Word has length 191 [2025-01-10 06:23:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:29,217 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1646 transitions. [2025-01-10 06:23:29,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 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-01-10 06:23:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1646 transitions. [2025-01-10 06:23:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:23:29,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:29,219 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, 1, 1, 1] [2025-01-10 06:23:29,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:23:29,419 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,SelfDestructingSolverStorable14 [2025-01-10 06:23:29,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 766054770, now seen corresponding path program 1 times [2025-01-10 06:23:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237649520] [2025-01-10 06:23:29,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:29,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:23:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:23:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:29,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237649520] [2025-01-10 06:23:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237649520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:29,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:23:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958932123] [2025-01-10 06:23:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:29,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:23:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:29,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:23:29,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:23:29,881 INFO L87 Difference]: Start difference. First operand 1204 states and 1646 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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-01-10 06:23:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:30,415 INFO L93 Difference]: Finished difference Result 2308 states and 3154 transitions. [2025-01-10 06:23:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:23:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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 192 [2025-01-10 06:23:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:30,422 INFO L225 Difference]: With dead ends: 2308 [2025-01-10 06:23:30,422 INFO L226 Difference]: Without dead ends: 1243 [2025-01-10 06:23:30,424 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-01-10 06:23:30,426 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 20 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:30,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2975 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:23:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-01-10 06:23:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1225. [2025-01-10 06:23:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1190 states have (on average 1.3588235294117648) internal successors, (1617), 1204 states have internal predecessors, (1617), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1673 transitions. [2025-01-10 06:23:30,458 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1673 transitions. Word has length 192 [2025-01-10 06:23:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1673 transitions. [2025-01-10 06:23:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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-01-10 06:23:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1673 transitions. [2025-01-10 06:23:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:23:30,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:30,462 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, 1, 1, 1] [2025-01-10 06:23:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:23:30,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:30,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash -32301554, now seen corresponding path program 1 times [2025-01-10 06:23:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328336679] [2025-01-10 06:23:30,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:23:30,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:23:30,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:30,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328336679] [2025-01-10 06:23:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328336679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491671276] [2025-01-10 06:23:31,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:31,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:31,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:23:31,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:23:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:23:31,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:31,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:31,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:23:31,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:32,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491671276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:32,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-01-10 06:23:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984847408] [2025-01-10 06:23:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:23:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:32,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:23:32,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:23:32,083 INFO L87 Difference]: Start difference. First operand 1225 states and 1673 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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-01-10 06:23:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:32,915 INFO L93 Difference]: Finished difference Result 2343 states and 3199 transitions. [2025-01-10 06:23:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:23:32,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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 192 [2025-01-10 06:23:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:32,921 INFO L225 Difference]: With dead ends: 2343 [2025-01-10 06:23:32,921 INFO L226 Difference]: Without dead ends: 1264 [2025-01-10 06:23:32,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:23:32,924 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 17 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:32,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2866 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 06:23:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-01-10 06:23:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2025-01-10 06:23:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1205 states have (on average 1.3568464730290457) internal successors, (1635), 1219 states have internal predecessors, (1635), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1691 transitions. [2025-01-10 06:23:32,954 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1691 transitions. Word has length 192 [2025-01-10 06:23:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:32,954 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1691 transitions. [2025-01-10 06:23:32,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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-01-10 06:23:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1691 transitions. [2025-01-10 06:23:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:23:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:32,956 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, 1, 1, 1, 1] [2025-01-10 06:23:32,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:23:33,157 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,SelfDestructingSolverStorable16 [2025-01-10 06:23:33,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1285394373, now seen corresponding path program 1 times [2025-01-10 06:23:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238846702] [2025-01-10 06:23:33,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:33,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:33,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238846702] [2025-01-10 06:23:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238846702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:23:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:23:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393614093] [2025-01-10 06:23:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:23:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:33,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:23:33,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:23:33,681 INFO L87 Difference]: Start difference. First operand 1240 states and 1691 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-10 06:23:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:34,290 INFO L93 Difference]: Finished difference Result 2361 states and 3223 transitions. [2025-01-10 06:23:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:23:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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 193 [2025-01-10 06:23:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:34,296 INFO L225 Difference]: With dead ends: 2361 [2025-01-10 06:23:34,296 INFO L226 Difference]: Without dead ends: 1267 [2025-01-10 06:23:34,298 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-01-10 06:23:34,299 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 23 mSDsluCounter, 3140 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:34,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3656 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:23:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-01-10 06:23:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1249. [2025-01-10 06:23:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1214 states have (on average 1.3542009884678747) internal successors, (1644), 1228 states have internal predecessors, (1644), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1700 transitions. [2025-01-10 06:23:34,328 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1700 transitions. Word has length 193 [2025-01-10 06:23:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:34,329 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1700 transitions. [2025-01-10 06:23:34,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-10 06:23:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1700 transitions. [2025-01-10 06:23:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:23:34,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:34,332 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, 1, 1, 1, 1] [2025-01-10 06:23:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:23:34,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:34,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -264636641, now seen corresponding path program 1 times [2025-01-10 06:23:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955703557] [2025-01-10 06:23:34,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:34,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:34,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:34,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:35,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:35,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955703557] [2025-01-10 06:23:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955703557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263216041] [2025-01-10 06:23:35,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:35,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:35,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:35,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:35,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:23:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:36,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:36,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:36,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 06:23:36,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:36,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263216041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-10 06:23:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242094813] [2025-01-10 06:23:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:23:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:36,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:23:36,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:23:36,537 INFO L87 Difference]: Start difference. First operand 1249 states and 1700 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-10 06:23:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:37,756 INFO L93 Difference]: Finished difference Result 2385 states and 3254 transitions. [2025-01-10 06:23:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:23:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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 193 [2025-01-10 06:23:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:37,762 INFO L225 Difference]: With dead ends: 2385 [2025-01-10 06:23:37,762 INFO L226 Difference]: Without dead ends: 1285 [2025-01-10 06:23:37,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:23:37,764 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 17 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:37,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3662 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 06:23:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-01-10 06:23:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1270. [2025-01-10 06:23:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1235 states have (on average 1.3530364372469637) internal successors, (1671), 1249 states have internal predecessors, (1671), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1727 transitions. [2025-01-10 06:23:37,786 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1727 transitions. Word has length 193 [2025-01-10 06:23:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:37,786 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1727 transitions. [2025-01-10 06:23:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-10 06:23:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1727 transitions. [2025-01-10 06:23:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:23:37,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:37,788 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, 1, 1, 1, 1] [2025-01-10 06:23:37,806 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-01-10 06:23:37,988 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-01-10 06:23:37,989 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -737820769, now seen corresponding path program 1 times [2025-01-10 06:23:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723908836] [2025-01-10 06:23:37,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:38,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:38,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:38,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:38,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:38,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723908836] [2025-01-10 06:23:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723908836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:38,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798242937] [2025-01-10 06:23:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:38,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:38,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:23:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:39,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:39,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:39,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:39,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:23:39,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:23:39,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798242937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:23:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336106954] [2025-01-10 06:23:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:23:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:39,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:23:39,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:23:39,396 INFO L87 Difference]: Start difference. First operand 1270 states and 1727 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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-01-10 06:23:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:39,767 INFO L93 Difference]: Finished difference Result 2421 states and 3298 transitions. [2025-01-10 06:23:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:23:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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 193 [2025-01-10 06:23:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:39,774 INFO L225 Difference]: With dead ends: 2421 [2025-01-10 06:23:39,774 INFO L226 Difference]: Without dead ends: 1312 [2025-01-10 06:23:39,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 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-01-10 06:23:39,776 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 39 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:39,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2524 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:23:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-01-10 06:23:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1291. [2025-01-10 06:23:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1256 states have (on average 1.3542993630573248) internal successors, (1701), 1270 states have internal predecessors, (1701), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:23:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1757 transitions. [2025-01-10 06:23:39,801 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1757 transitions. Word has length 193 [2025-01-10 06:23:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1757 transitions. [2025-01-10 06:23:39,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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-01-10 06:23:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1757 transitions. [2025-01-10 06:23:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:23:39,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:39,803 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, 1, 1, 1, 1] [2025-01-10 06:23:39,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:23:40,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:40,004 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:40,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1744929818, now seen corresponding path program 1 times [2025-01-10 06:23:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:40,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020259190] [2025-01-10 06:23:40,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:40,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:23:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020259190] [2025-01-10 06:23:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020259190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603456303] [2025-01-10 06:23:40,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:40,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:40,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:40,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:40,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:23:41,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:23:41,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:23:41,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:41,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:23:41,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:23:41,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:23:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603456303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:23:41,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:23:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:23:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242793334] [2025-01-10 06:23:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:23:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:23:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:23:41,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:23:41,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:23:41,409 INFO L87 Difference]: Start difference. First operand 1291 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-01-10 06:23:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:23:41,451 INFO L93 Difference]: Finished difference Result 2382 states and 3255 transitions. [2025-01-10 06:23:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:23:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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 193 [2025-01-10 06:23:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:23:41,457 INFO L225 Difference]: With dead ends: 2382 [2025-01-10 06:23:41,457 INFO L226 Difference]: Without dead ends: 1294 [2025-01-10 06:23:41,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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-01-10 06:23:41,460 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:23:41,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1568 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:23:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-10 06:23:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-10 06:23:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1258 states have (on average 1.354531001589825) internal successors, (1704), 1273 states have internal predecessors, (1704), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:23:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-01-10 06:23:41,497 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 193 [2025-01-10 06:23:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:23:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-01-10 06:23:41,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-01-10 06:23:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-01-10 06:23:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-10 06:23:41,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:23:41,500 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, 1, 1, 1, 1] [2025-01-10 06:23:41,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:23:41,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:41,701 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:23:41,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:23:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1620200482, now seen corresponding path program 1 times [2025-01-10 06:23:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:23:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263106241] [2025-01-10 06:23:41,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:23:41,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-10 06:23:42,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-10 06:23:42,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:42,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:23:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:23:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263106241] [2025-01-10 06:23:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263106241] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:23:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001917340] [2025-01-10 06:23:42,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:23:42,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:23:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:23:42,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:23:42,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:23:43,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-10 06:23:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-10 06:23:43,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:23:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:23:43,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-01-10 06:23:43,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:23:43,565 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-01-10 06:23:43,605 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-01-10 06:23:43,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-01-10 06:23:43,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-10 06:23:44,009 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-01-10 06:23:44,025 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:23:44,026 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-01-10 06:23:44,040 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 23 treesize of output 11 [2025-01-10 06:23:44,046 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-01-10 06:23:44,126 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-01-10 06:23:44,131 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-01-10 06:23:44,136 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-01-10 06:23:44,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:23:44,303 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-01-10 06:23:44,306 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 [2025-01-10 06:23:44,315 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