./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.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 f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:50:29,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:50:29,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:50:29,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:50:29,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:50:29,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:50:29,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:50:29,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:50:29,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:50:29,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:50:29,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:50:29,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:50:29,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:50:29,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:50:29,761 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:50:29,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:50:29,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:50:29,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:50:29,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:50:29,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:50:29,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:50:29,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:50:29,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:50:29,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:50:29,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:50:29,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:50:29,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:50:29,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:50:29,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:50:29,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:50:29,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:50:29,765 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2025-02-08 13:50:30,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:50:30,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:50:30,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:50:30,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:50:30,060 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:50:30,063 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_SFH_test3-1.i [2025-02-08 13:50:31,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50a1f1a2a/40939823e3504f6bb5e92fac71c9484b/FLAG16fb38062 [2025-02-08 13:50:31,670 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:50:31,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2025-02-08 13:50:31,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50a1f1a2a/40939823e3504f6bb5e92fac71c9484b/FLAG16fb38062 [2025-02-08 13:50:31,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50a1f1a2a/40939823e3504f6bb5e92fac71c9484b [2025-02-08 13:50:31,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:50:31,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:50:31,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:50:31,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:50:31,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:50:31,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:31" (1/1) ... [2025-02-08 13:50:31,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7859235d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:31, skipping insertion in model container [2025-02-08 13:50:31,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:50:31" (1/1) ... [2025-02-08 13:50:31,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:50:32,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:50:32,234 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:50:32,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:50:32,361 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:50:32,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32 WrapperNode [2025-02-08 13:50:32,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:50:32,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:50:32,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:50:32,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:50:32,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,470 INFO L138 Inliner]: procedures = 177, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1418 [2025-02-08 13:50:32,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:50:32,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:50:32,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:50:32,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:50:32,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,577 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 34, 219]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 13:50:32,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:50:32,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:50:32,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:50:32,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:50:32,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (1/1) ... [2025-02-08 13:50:32,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:50:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:32,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:50:32,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:50:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:50:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:50:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:50:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:50:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:50:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:50:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:50:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:50:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:50:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:50:32,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:50:32,902 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:50:32,903 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:50:34,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:50:34,462 INFO L? ?]: Removed 332 outVars from TransFormulas that were not future-live. [2025-02-08 13:50:34,462 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:50:34,541 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:50:34,541 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:50:34,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:34 BoogieIcfgContainer [2025-02-08 13:50:34,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:50:34,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:50:34,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:50:34,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:50:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:50:31" (1/3) ... [2025-02-08 13:50:34,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee1966e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:34, skipping insertion in model container [2025-02-08 13:50:34,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:50:32" (2/3) ... [2025-02-08 13:50:34,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee1966e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:50:34, skipping insertion in model container [2025-02-08 13:50:34,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:50:34" (3/3) ... [2025-02-08 13:50:34,557 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2025-02-08 13:50:34,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:50:34,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test3-1.i that has 6 procedures, 430 locations, 1 initial locations, 38 loop locations, and 8 error locations. [2025-02-08 13:50:34,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:50:34,664 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;@2a68373e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:50:34,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 13:50:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 422 states, 399 states have (on average 1.6290726817042607) internal successors, (650), 414 states have internal predecessors, (650), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:50:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:50:34,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:34,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:50:34,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 829144953, now seen corresponding path program 1 times [2025-02-08 13:50:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25838492] [2025-02-08 13:50:34,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:34,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:50:34,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:50:34,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:34,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25838492] [2025-02-08 13:50:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25838492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:34,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:50:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939477347] [2025-02-08 13:50:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:34,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:50:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:50:34,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:50:34,885 INFO L87 Difference]: Start difference. First operand has 422 states, 399 states have (on average 1.6290726817042607) internal successors, (650), 414 states have internal predecessors, (650), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:35,016 INFO L93 Difference]: Finished difference Result 841 states and 1343 transitions. [2025-02-08 13:50:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:50:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:50:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:35,026 INFO L225 Difference]: With dead ends: 841 [2025-02-08 13:50:35,026 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 13:50:35,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:50:35,034 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:35,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:50:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 13:50:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-08 13:50:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4591836734693877) internal successors, (572), 399 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 578 transitions. [2025-02-08 13:50:35,099 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 578 transitions. Word has length 6 [2025-02-08 13:50:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:35,100 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 578 transitions. [2025-02-08 13:50:35,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 578 transitions. [2025-02-08 13:50:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:50:35,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:35,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:50:35,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:50:35,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:35,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash 829145914, now seen corresponding path program 1 times [2025-02-08 13:50:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664226943] [2025-02-08 13:50:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:35,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:50:35,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:50:35,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:35,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:50:35,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461703499] [2025-02-08 13:50:35,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:35,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:35,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:35,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:50:35,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:50:35,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:50:35,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:35,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:35,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:50:35,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:35,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664226943] [2025-02-08 13:50:35,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:50:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461703499] [2025-02-08 13:50:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461703499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:50:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634789906] [2025-02-08 13:50:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:35,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:35,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:50:35,390 INFO L87 Difference]: Start difference. First operand 404 states and 578 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:35,718 INFO L93 Difference]: Finished difference Result 803 states and 1151 transitions. [2025-02-08 13:50:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:50:35,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:50:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:35,723 INFO L225 Difference]: With dead ends: 803 [2025-02-08 13:50:35,723 INFO L226 Difference]: Without dead ends: 801 [2025-02-08 13:50:35,724 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-02-08 13:50:35,724 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 560 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:35,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1534 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:50:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-08 13:50:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 410. [2025-02-08 13:50:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.4547738693467336) internal successors, (579), 405 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 585 transitions. [2025-02-08 13:50:35,754 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 585 transitions. Word has length 6 [2025-02-08 13:50:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:35,755 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 585 transitions. [2025-02-08 13:50:35,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 585 transitions. [2025-02-08 13:50:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 13:50:35,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:35,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:50:35,764 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-02-08 13:50:35,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:35,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:35,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1567383316, now seen corresponding path program 1 times [2025-02-08 13:50:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308710299] [2025-02-08 13:50:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:50:35,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:50:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308710299] [2025-02-08 13:50:36,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308710299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:36,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:36,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:50:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346426689] [2025-02-08 13:50:36,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:36,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:36,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:50:36,129 INFO L87 Difference]: Start difference. First operand 410 states and 585 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:36,410 INFO L93 Difference]: Finished difference Result 998 states and 1432 transitions. [2025-02-08 13:50:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:50:36,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 13:50:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:36,417 INFO L225 Difference]: With dead ends: 998 [2025-02-08 13:50:36,419 INFO L226 Difference]: Without dead ends: 800 [2025-02-08 13:50:36,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:50:36,424 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 561 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:36,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1539 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:50:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-08 13:50:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 410. [2025-02-08 13:50:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.4522613065326633) internal successors, (578), 405 states have internal predecessors, (578), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 584 transitions. [2025-02-08 13:50:36,456 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 584 transitions. Word has length 9 [2025-02-08 13:50:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 584 transitions. [2025-02-08 13:50:36,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 584 transitions. [2025-02-08 13:50:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:50:36,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:36,459 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] [2025-02-08 13:50:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:50:36,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1173808094, now seen corresponding path program 1 times [2025-02-08 13:50:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434835637] [2025-02-08 13:50:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:36,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:50:36,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:50:36,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:36,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434835637] [2025-02-08 13:50:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434835637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:50:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263738966] [2025-02-08 13:50:36,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:36,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:50:36,903 INFO L87 Difference]: Start difference. First operand 410 states and 584 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:37,073 INFO L93 Difference]: Finished difference Result 771 states and 1095 transitions. [2025-02-08 13:50:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:50:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:50:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:37,075 INFO L225 Difference]: With dead ends: 771 [2025-02-08 13:50:37,076 INFO L226 Difference]: Without dead ends: 368 [2025-02-08 13:50:37,077 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-02-08 13:50:37,077 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 33 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:37,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1310 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:50:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-08 13:50:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-08 13:50:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.4073033707865168) internal successors, (501), 363 states have internal predecessors, (501), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 507 transitions. [2025-02-08 13:50:37,099 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 507 transitions. Word has length 79 [2025-02-08 13:50:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 507 transitions. [2025-02-08 13:50:37,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 507 transitions. [2025-02-08 13:50:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:50:37,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:37,103 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] [2025-02-08 13:50:37,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:50:37,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:37,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash 516905269, now seen corresponding path program 1 times [2025-02-08 13:50:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360681039] [2025-02-08 13:50:37,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:37,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:50:37,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:50:37,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:37,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:37,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360681039] [2025-02-08 13:50:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360681039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:50:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360863217] [2025-02-08 13:50:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:37,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:50:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:37,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:50:37,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:50:37,330 INFO L87 Difference]: Start difference. First operand 368 states and 507 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:37,446 INFO L93 Difference]: Finished difference Result 729 states and 1007 transitions. [2025-02-08 13:50:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:50:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:50:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:37,449 INFO L225 Difference]: With dead ends: 729 [2025-02-08 13:50:37,449 INFO L226 Difference]: Without dead ends: 368 [2025-02-08 13:50:37,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:50:37,450 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 2 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:37,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 890 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:50:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-08 13:50:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-08 13:50:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.398876404494382) internal successors, (498), 363 states have internal predecessors, (498), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 504 transitions. [2025-02-08 13:50:37,470 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 504 transitions. Word has length 79 [2025-02-08 13:50:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:37,471 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 504 transitions. [2025-02-08 13:50:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 504 transitions. [2025-02-08 13:50:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:50:37,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:37,473 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] [2025-02-08 13:50:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:50:37,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -981305640, now seen corresponding path program 1 times [2025-02-08 13:50:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957440944] [2025-02-08 13:50:37,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:50:37,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:50:37,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:37,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957440944] [2025-02-08 13:50:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957440944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:50:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387808528] [2025-02-08 13:50:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:37,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:50:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:37,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:50:37,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:50:37,715 INFO L87 Difference]: Start difference. First operand 368 states and 504 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:37,904 INFO L93 Difference]: Finished difference Result 978 states and 1357 transitions. [2025-02-08 13:50:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:50:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:50:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:37,908 INFO L225 Difference]: With dead ends: 978 [2025-02-08 13:50:37,909 INFO L226 Difference]: Without dead ends: 617 [2025-02-08 13:50:37,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:50:37,911 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 296 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:37,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1067 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:50:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-02-08 13:50:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2025-02-08 13:50:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 601 states have (on average 1.4143094841930117) internal successors, (850), 608 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:50:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 856 transitions. [2025-02-08 13:50:37,934 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 856 transitions. Word has length 79 [2025-02-08 13:50:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:37,934 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 856 transitions. [2025-02-08 13:50:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:50:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 856 transitions. [2025-02-08 13:50:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:50:37,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:37,937 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] [2025-02-08 13:50:37,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:50:37,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1891758978, now seen corresponding path program 1 times [2025-02-08 13:50:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274922053] [2025-02-08 13:50:37,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:37,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:50:38,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:50:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:50:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274922053] [2025-02-08 13:50:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274922053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:50:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156860468] [2025-02-08 13:50:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:38,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:38,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:50:38,336 INFO L87 Difference]: Start difference. First operand 613 states and 856 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:38,584 INFO L93 Difference]: Finished difference Result 908 states and 1269 transitions. [2025-02-08 13:50:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:50:38,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2025-02-08 13:50:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:38,588 INFO L225 Difference]: With dead ends: 908 [2025-02-08 13:50:38,589 INFO L226 Difference]: Without dead ends: 906 [2025-02-08 13:50:38,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:50:38,590 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 393 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:38,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1316 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:50:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-02-08 13:50:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 676. [2025-02-08 13:50:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 661 states have (on average 1.4024205748865355) internal successors, (927), 668 states have internal predecessors, (927), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:50:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 939 transitions. [2025-02-08 13:50:38,623 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 939 transitions. Word has length 94 [2025-02-08 13:50:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:38,623 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 939 transitions. [2025-02-08 13:50:38,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 939 transitions. [2025-02-08 13:50:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 13:50:38,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:38,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-08 13:50:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:50:38,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:38,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash -109941490, now seen corresponding path program 1 times [2025-02-08 13:50:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115022760] [2025-02-08 13:50:38,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:38,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:50:38,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:50:38,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:38,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:50:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115022760] [2025-02-08 13:50:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115022760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161213053] [2025-02-08 13:50:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:39,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:39,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:39,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:39,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:50:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:50:39,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:50:39,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:39,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:39,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:50:39,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:39,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:39,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:39,537 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 27 treesize of output 11 [2025-02-08 13:50:40,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:50:40,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-08 13:50:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:50:40,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161213053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 13:50:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669398119] [2025-02-08 13:50:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:50:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:50:40,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:50:40,319 INFO L87 Difference]: Start difference. First operand 676 states and 939 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:44,326 INFO L93 Difference]: Finished difference Result 1540 states and 2160 transitions. [2025-02-08 13:50:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:50:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 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 100 [2025-02-08 13:50:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:44,330 INFO L225 Difference]: With dead ends: 1540 [2025-02-08 13:50:44,330 INFO L226 Difference]: Without dead ends: 908 [2025-02-08 13:50:44,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2025-02-08 13:50:44,332 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 591 mSDsluCounter, 3380 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 3849 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:44,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 3849 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 13:50:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-02-08 13:50:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 676. [2025-02-08 13:50:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 661 states have (on average 1.4009077155824508) internal successors, (926), 668 states have internal predecessors, (926), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:50:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 938 transitions. [2025-02-08 13:50:44,352 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 938 transitions. Word has length 100 [2025-02-08 13:50:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:44,352 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 938 transitions. [2025-02-08 13:50:44,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 938 transitions. [2025-02-08 13:50:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 13:50:44,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:44,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-08 13:50:44,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:50:44,556 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-02-08 13:50:44,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:44,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1643517546, now seen corresponding path program 1 times [2025-02-08 13:50:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:44,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314015698] [2025-02-08 13:50:44,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:44,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:44,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:50:44,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:50:44,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:44,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:50:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314015698] [2025-02-08 13:50:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314015698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442248950] [2025-02-08 13:50:44,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:44,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:44,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:50:45,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:50:45,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:50:45,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:45,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:45,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:50:45,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:50:45,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442248950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:45,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:50:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518321801] [2025-02-08 13:50:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:45,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:50:45,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:45,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:50:45,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:50:45,445 INFO L87 Difference]: Start difference. First operand 676 states and 938 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:50:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:45,548 INFO L93 Difference]: Finished difference Result 1261 states and 1763 transitions. [2025-02-08 13:50:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:50:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-02-08 13:50:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:45,556 INFO L225 Difference]: With dead ends: 1261 [2025-02-08 13:50:45,556 INFO L226 Difference]: Without dead ends: 679 [2025-02-08 13:50:45,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:50:45,558 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 0 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:45,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1373 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:50:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-08 13:50:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-02-08 13:50:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 663 states have (on average 1.401206636500754) internal successors, (929), 671 states have internal predecessors, (929), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 943 transitions. [2025-02-08 13:50:45,580 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 943 transitions. Word has length 101 [2025-02-08 13:50:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:45,580 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 943 transitions. [2025-02-08 13:50:45,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:50:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 943 transitions. [2025-02-08 13:50:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:50:45,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:45,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-02-08 13:50:45,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:50:45,782 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-02-08 13:50:45,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:45,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2027866290, now seen corresponding path program 1 times [2025-02-08 13:50:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729718204] [2025-02-08 13:50:45,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:45,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:45,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:50:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:50:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:46,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729718204] [2025-02-08 13:50:46,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729718204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718629014] [2025-02-08 13:50:46,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:46,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:46,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:46,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:50:46,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:50:46,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:50:46,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:46,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-08 13:50:46,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:46,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:46,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 13:50:46,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:50:46,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 13:50:47,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-08 13:50:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:50:47,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:50:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718629014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:50:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 16 [2025-02-08 13:50:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908521929] [2025-02-08 13:50:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:47,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:50:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:47,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:50:47,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-08 13:50:47,904 INFO L87 Difference]: Start difference. First operand 679 states and 943 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:51,575 INFO L93 Difference]: Finished difference Result 1556 states and 2179 transitions. [2025-02-08 13:50:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:50:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 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 103 [2025-02-08 13:50:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:51,580 INFO L225 Difference]: With dead ends: 1556 [2025-02-08 13:50:51,580 INFO L226 Difference]: Without dead ends: 926 [2025-02-08 13:50:51,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-02-08 13:50:51,582 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 773 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:51,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3338 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 13:50:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-08 13:50:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 683. [2025-02-08 13:50:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 667 states have (on average 1.4002998500749626) internal successors, (934), 675 states have internal predecessors, (934), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 948 transitions. [2025-02-08 13:50:51,626 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 948 transitions. Word has length 103 [2025-02-08 13:50:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 948 transitions. [2025-02-08 13:50:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 948 transitions. [2025-02-08 13:50:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:50:51,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:51,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-02-08 13:50:51,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:50:51,832 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,SelfDestructingSolverStorable9 [2025-02-08 13:50:51,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1299866161, now seen corresponding path program 1 times [2025-02-08 13:50:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527853342] [2025-02-08 13:50:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:50:51,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:50:51,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:51,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:50:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527853342] [2025-02-08 13:50:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527853342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:50:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036944179] [2025-02-08 13:50:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:50:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:50:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:50:52,150 INFO L87 Difference]: Start difference. First operand 683 states and 948 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:52,443 INFO L93 Difference]: Finished difference Result 1321 states and 1849 transitions. [2025-02-08 13:50:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:50:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 104 [2025-02-08 13:50:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:52,446 INFO L225 Difference]: With dead ends: 1321 [2025-02-08 13:50:52,448 INFO L226 Difference]: Without dead ends: 689 [2025-02-08 13:50:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:50:52,450 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 9 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:52,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1636 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:50:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-08 13:50:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-08 13:50:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 673 states have (on average 1.3967310549777117) internal successors, (940), 681 states have internal predecessors, (940), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 954 transitions. [2025-02-08 13:50:52,471 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 954 transitions. Word has length 104 [2025-02-08 13:50:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:52,471 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 954 transitions. [2025-02-08 13:50:52,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 954 transitions. [2025-02-08 13:50:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:50:52,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:52,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-02-08 13:50:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:50:52,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1257117813, now seen corresponding path program 1 times [2025-02-08 13:50:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152166622] [2025-02-08 13:50:52,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:50:52,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:50:52,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:52,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:50:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152166622] [2025-02-08 13:50:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152166622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:50:52,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:50:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:50:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792942588] [2025-02-08 13:50:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:50:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:50:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:50:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:50:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:50:52,800 INFO L87 Difference]: Start difference. First operand 689 states and 954 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:50:53,260 INFO L93 Difference]: Finished difference Result 1327 states and 1853 transitions. [2025-02-08 13:50:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:50:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 104 [2025-02-08 13:50:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:50:53,264 INFO L225 Difference]: With dead ends: 1327 [2025-02-08 13:50:53,264 INFO L226 Difference]: Without dead ends: 699 [2025-02-08 13:50:53,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:50:53,266 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 14 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:50:53,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2378 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:50:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-08 13:50:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2025-02-08 13:50:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 681 states have (on average 1.395007342143906) internal successors, (950), 689 states have internal predecessors, (950), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:50:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 964 transitions. [2025-02-08 13:50:53,284 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 964 transitions. Word has length 104 [2025-02-08 13:50:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:50:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 964 transitions. [2025-02-08 13:50:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:50:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 964 transitions. [2025-02-08 13:50:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 13:50:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:50:53,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-02-08 13:50:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:50:53,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:50:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:50:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -238010832, now seen corresponding path program 1 times [2025-02-08 13:50:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:50:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429553898] [2025-02-08 13:50:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:50:53,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:50:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:50:53,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:53,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:50:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:50:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429553898] [2025-02-08 13:50:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429553898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:50:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274118649] [2025-02-08 13:50:53,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:50:53,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:50:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:50:53,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:50:53,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:50:53,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:50:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:50:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:50:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:50:54,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-02-08 13:50:54,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:50:54,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 13:50:54,240 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 13 treesize of output 9 [2025-02-08 13:50:54,245 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 19 treesize of output 1 [2025-02-08 13:50:54,267 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-08 13:50:54,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-08 13:50:54,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2025-02-08 13:50:54,336 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 9 treesize of output 3 [2025-02-08 13:50:54,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 13:50:54,461 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 13:50:54,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 13:50:58,408 INFO L224 Elim1Store]: Index analysis took 298 ms